# Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice

@article{Ishihara2018ConsistencyOT,
title={Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice},
author={Hajime Ishihara and Maria Emilia Maietti and Samuele Maschio and Thomas Streicher},
journal={Archive for Mathematical Logic},
year={2018},
volume={57},
pages={873-888}
}
• Published 27 January 2018
• Philosophy
• Archive for Mathematical Logic
Consistency with the formal Church’s thesis, for short CT, and the axiom of choice, for short AC, was one of the requirements asked to be satisfied by the intensional level of a two-level foundation for constructive mathematics as proposed by Maietti and Sambin (in Crosilla, Schuster (eds) From sets and types to topology and analysis: practicable foundations for constructive mathematics, Oxford University Press, Oxford, 2005). Here we show that this is the case for the intensional level of the…
12 Citations
Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice
• Philosophy
• 2021
In this work we consider an extension MFcind of the Minimalist Foundation MF for predicative constructive mathematics with the addition of inductive and coinductive topological definitions sufficient
A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice
• Philosophy
Log. Methods Comput. Sci.
• 2021
A Kleene realizability semantics for the intensional level of the Minimalist Foundation is presented, formalized in a constructive theory represented by Aczel's constructive set theory CZF extended with the regular extension axiom.
Game semantics of Martin-Löf type theory, part III: its consistency with Church's thesis
This work proves consistency of intensional Martin-Lof type theory with formal Church's thesis (CT) by novel realizability a la game semantics, which is based on the author's previous work.
2 8 M ay 2 01 9 A REALIZABILITY SEMANTICS FOR INDUCTIVE FORMAL TOPOLOGIES , CHURCH ’ S THESIS AND AXIOM OF CHOICE
• Philosophy
• 2019
We present a Kleene realizability semantics for the intensional level of the Minimalist Foundation, for shortmTT, extended with inductively generated formal topologies, Church’s thesis and axiom of
Parametric Church's Thesis: Synthetic Computability Without Choice
This work introduces various parametric strengthenings of CTφ, which are equivalent to assuming CT φ and an S n operator for φ like in the S n theorem, and explains the novel axioms and proofs of Rice’s theorem.
The Compatibility of the Minimalist Foundation with Homotopy Type Theory
• Mathematics
• 2022
The Minimalist Foundation, for short MF , is a two-level foundation for constructive mathematics ideated by Maietti and Sambin in 2005 and then fully formalized by Maietti in 2009. MF serves as a
Elementary quotient completions : a brief
• Philosophy
• 2019
Hyland’s effective topos offers an important realizability model for constructive mathematics in the form of a category whose internal logic validates Church’s Thesis. It also contains a boolean full
On Church's Thesis in Cubical Assemblies
• Philosophy
Mathematical Structures in Computer Science
• 2022
It is shown that Church's thesis, the axiom stating that all functions on the naturals are computable, does not hold in the cubical assemblies model of cubical type theory, but is consistent with univalent type theory by constructing a reflective subuniverse of cubICAL assemblies where it holds.
A PREDICATIVE VARIANT OF HYLAND’S EFFECTIVE TOPOS
• Computer Science
The Journal of Symbolic Logic
• 2020
Abstract Here, we present a category ${\mathbf {pEff}}$ which can be considered a predicative variant of Hyland's Effective Topos ${{\mathbf {Eff} }}$ for the following reasons. First, its
Elementary Quotient Completions, Church's Thesis, and Partioned Assemblies
• Philosophy
Log. Methods Comput. Sci.
• 2019
The effective topos and the quasitopos of assemblies as elementary quotient completions of Lawvere doctrines based on partitioned assemblies are compared to explain why the two forms of (CT) each one satisfies differ as inherited from specific properties of the doctrine which determines each Elementary quotient completion.

## References

SHOWING 1-10 OF 56 REFERENCES
Modular correspondence between dependent type theories and categories including pretopoi and topoi
• M. Maietti
• Philosophy
Mathematical Structures in Computer Science
• 2005
A modular correspondence between various categorical structures and their internal languages in terms of extensional dependent type theories à la Martin-Löf is presented and formulas corresponding to subobjects can be regained as particular types that are equipped with proof-terms according to the isomorphism ‘propositions as mono types’.
Sheaves in geometry and logic: a first introduction to topos theory
• Mathematics
• 1992
This text presents topos theory as it has developed from the study of sheaves. Sheaves arose in geometry as coefficients for cohomology and as descriptions of the functions appropriate to various
Quotient Completion for the Foundation of Constructive Mathematics
• Mathematics
Logica Universalis
• 2013
Some tools developed in categorical logic are applied to give an abstract description of constructions used to formalize constructive mathematics in foundations based on intensional type theory, including the exact completion on a category with weak finite limits as an instance.
Unifying Exact Completions
• Mathematics
Appl. Categorical Struct.
• 2015
We define the notion of exact completion with respect to an existential elementary doctrine. We observe that the forgetful functor from the 2-category of exact categories to existential elementary
Setoids in type theory
• Mathematics
Journal of Functional Programming
• 2003
It is proved that one approach to partial setoids in unsuitable, and that the other approaches can be divided in two classes of equivalence, that has been useful in the modeling of type systems.
Programming in Martin-Löf's Type Theory
• Mathematics
• 1990
data type, 179 abstraction, 14 Abstraction rule, 143 absurdity, 43 append, 68 application, 13 Application rule, 143 apply, 48, 148 arity of an expression, 18 Assumption rule, 123, 142 AUTOMATH, 8