We gratefully acknowledge support from
the Simons Foundation
and member institutions
Full-text links:

Download:

Current browse context:

cs.LO

Change to browse by:

cs

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo ScienceWISE logo

Computer Science > Logic in Computer Science

Title: Stack Semantics of Type Theory

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.
Subjects: Logic in Computer Science (cs.LO)
ACM classes: F.3.2; F.4.1
Cite as: arXiv:1701.02571 [cs.LO]
  (or arXiv:1701.02571v2 [cs.LO] for this version)

Submission history

From: Bassel Mannaa [view email]
[v1] Tue, 10 Jan 2017 13:09:52 GMT (21kb)
[v2] Wed, 19 Apr 2017 19:39:28 GMT (100kb)