On Choice Rules in Dependent Type Theory

  title={On Choice Rules in Dependent Type Theory},
  author={Maria Emilia Maietti},
  • M. Maietti
  • Published in TAMC 20 April 2017
  • Philosophy
In a dependent type theory satisfying the propositions as types correspondence together with the proofs-as-programs paradigm, the validity of the unique choice rule or even more of the choice rule says that the extraction of a computable witness from an existential statement under hypothesis can be performed within the same theory. 
Quantifier completions, choice principles and applications.
We give an expositional account of the quantifier completions by using the language of doctrines. This algebraic presentation allows us to properly analyse the behaviour of the existential and
Elementary quotient completions : a brief
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
Choice principles via the existential completion
It is well know that choice principles, such as Zermelo’s axiom of choice, are not generally valid in constructive foundations for mathematics which include quotient sets. Also Hilbert’s epsilon
The G\"odel Fibration
We introduce the notion of a Gödel fibration, which is a fibration categorically embodying both the logical principle of traditional Skolemization (we can exchange the order of quantifiers paying the
The Compatibility of the Minimalist Foundation with Homotopy Type Theory
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, Church's Thesis, and Partioned Assemblies
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.


Quotient Completion for the Foundation of Constructive Mathematics
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.
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’.
Unifying Exact Completions
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
Relating Quotient Completions via Categorical Logic
In previous work we introduced the notion of elementary quotient completion with respect to an elementary doctrine. We also generalized the notion of exact completion of a regular category as an
Consistency of the intensional level of the Minimalist Foundation with Church’s thesis and axiom of choice
It is shown that consistency with the formal Church’s thesis and the axiom of choice are satisfied by the intensional level of the two-level Minimalist Foundation, for short MF, completed in 2009 by the second author.
We extend the notion of exact completion on a category with weak nite limits to Lawvere's elementary doctrines. We show how any such doctrine admits an ele- mentary quotient completion, which is the
Intuitionistic Type Theory
The main idea is that mathematical concepts such as elements, sets and functions are explained in terms of concepts from programming such as data structures, data types and programs.
Constructivism in Mathematics: An Introduction
A Predicative Variant of a Realizability Tripos for the Minimalist Foundation
One could also mention the field of Model Theory, where new axioms of Set Theory may play an important role in the development of algebra.