DeepAI AI Chat
Log In Sign Up

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

by   Yannick Forster, et al.

"Church's thesis" (𝖒𝖳) as an axiom in constructive logic states that every total function of type β„•β†’β„• is computable, i.e. definable in a model of computation. 𝖒𝖳 is inconsistent in both classical mathematics and in Brouwer's intuitionism since it contradicts Weak KΓΆnig's Lemma and the fan theorem, respectively. Recently, 𝖒𝖳 was proved consistent for (univalent) constructive type theory. Since neither Weak KΓΆnig's Lemma nor the fan theorem are a consequence of just logical axioms or just choice-like axioms assumed in constructive logic, it seems likely that 𝖒𝖳 is inconsistent only with a combination of classical logic and choice axioms. We study consequences of 𝖒𝖳 and its relation to several classes of axioms in Coq's type theory, a constructive type theory with a universe of propositions which does neither prove classical logical axioms nor strong choice axioms. We thereby provide a partial answer to the question which axioms may preserve computational intuitions inherent to type theory, and which certainly do not. The paper can also be read as a broad survey of axioms in type theory, with all results mechanised in the Coq proof assistant.


page 1

page 2

page 3

page 4

βˆ™ 02/28/2023

An Analysis of Tennenbaum's Theorem in Constructive Type Theory

Tennenbaum's theorem states that the only countable model of Peano arith...
βˆ™ 12/22/2021

Parametric Church's Thesis: Synthetic Computability without Choice

In synthetic computability, pioneered by Richman, Bridges, and Bauer, on...
βˆ™ 05/07/2021

Constructing Initial Algebras Using Inflationary Iteration

An old theorem of AdΓ‘mek constructs initial algebras for sufficiently co...
βˆ™ 05/19/2021

On the logical structure of choice and bar induction principles

We develop an approach to choice principles and their contrapositive bar...
βˆ™ 04/29/2021

Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens

We study finite first-order satisfiability (FSAT) in the constructive se...
βˆ™ 05/05/2023

Skolemization in Simple Type Theory: the Logical and the Theoretical Points of View

Peter Andrews has proposed, in 1971, the problem of finding an analog of...
βˆ™ 10/11/2022

Strong negation in the theory of computable functionals TCF

We incorporate strong negation in the theory of computable functionals T...