activity
20202023
most citedCompleteness Theorems for First-Order Logic Analysed in Constructive Type Theory (Extended Version)

17 citations · 23 across the 5 of their papers we have counts for

collaborators
Showing math.LOShow all

1 paper · 1 filter

math.LO2023

An Analysis of Tennenbaum's Theorem in Constructive Type Theory

Marc Hermes, Dominik Kirst

Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper,…