
On Church's Thesis in Cubical Assemblies
We show that Church's thesis, the axiom stating that all functions on th...
read it

Constructing Initial Algebras Using Inflationary Iteration
An old theorem of AdΓ‘mek constructs initial algebras for sufficiently co...
read it

On the logical structure of choice and bar induction principles
We develop an approach to choice principles and their contrapositive bar...
read it

Constructive Domains with Classical Witnesses
We develop a constructive theory of continuous domains from the perspect...
read it

CantorBernstein implies Excluded Middle
We prove in constructive logic that the statement of the CantorBernstei...
read it

Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens
We study finite firstorder satisfiability (FSAT) in the constructive se...
read it

Game semantics of MartinLΓΆf type theory, part III: its consistency with Church's thesis
We prove consistency of intensional MartinLΓΆf type theory (MLTT) with f...
read it
Church's thesis and related axioms in Coq's type theory
"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 choicelike 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.
READ FULL TEXT
Comments
There are no comments yet.