Year: 2017
Type: preprint
Abstract: We give a model of dependent type theory with one univalent universe and propositional truncation interpreting a type as a stack, generalising the groupoid model of type theory. As an application, we show that countable choice cannot be proved in dependent type theory with one univalent universe and propositional truncation.
Source: arXiv (Cornell University)
Authors: Coquand, Thierry, Mannaa, Bassel, Ruch, Fabian
Institutions: IT University of Copenhagen, University of Gothenburg
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4298412303