DeepAI AI Chat
Log In Sign Up

An Analysis of Tennenbaum's Theorem in Constructive Type Theory

by   Marc Hermes, et al.
Universität Saarland
Radboud Universiteit

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, we use constructive type theory as a framework to revisit, analyze and generalize this result. The chosen framework allows for a synthetic approach to computability theory, exploiting that, externally, all functions definable in constructive type theory can be shown computable. We then build on this viewpoint and furthermore internalize it by assuming a version of Church's thesis, which expresses that any function on natural numbers is representable by a formula in PA. This assumption provides for a conveniently abstract setup to carry out rigorous computability arguments, even in the theorem's mechanization. Concretely, we constructivize several classical proofs and present one inherently constructive rendering of Tennenbaum's theorem, all following arguments from the literature. Concerning the classical proofs in particular, the constructive setting allows us to highlight differences in their assumptions and conclusions which are not visible classically. All versions are accompanied by a unified mechanization in the Coq proof assistant.


page 1

page 2

page 3

page 4


Church's thesis and related axioms in Coq's type theory

"Church's thesis" (𝖢𝖳) as an axiom in constructive logic states that eve...

Constructive Analysis in the Agda Proof Assistant

Proof assistant software has recently been used to verify proofs of majo...

Parametric Church's Thesis: Synthetic Computability without Choice

In synthetic computability, pioneered by Richman, Bridges, and Bauer, on...

Formalizing π_4(𝕊^3) ≅ℤ/2ℤ and Computing a Brunerie Number in Cubical Agda

Brunerie's 2016 PhD thesis contains the first synthetic proof in Homotop...

Constructive Domains with Classical Witnesses

We develop a constructive theory of continuous domains from the perspect...

Hilbert's Tenth Problem in Coq

We formalise the undecidability of solvability of Diophantine equations,...

Bar recursion is not computable via iteration

We show that the bar recursion operators of Spector and Kohlenbach, cons...