English
Related papers

Related papers: Decomposing the Univalence Axiom

200 papers

Connections between homotopy theory and type theory have recently attracted a lot of attention, with Voevodsky's univalent foundations and the interpretation of Martin-Lof's identity types in Quillen model categories as some of the…

Category Theory · Mathematics 2016-09-21 Benno van den Berg

As observed recently by various people the topos $\mathbf{sSet}$ of simplicial sets appears as essential subtopos of a topos $\mathbf{cSet}$ of cubical sets, namely presheaves over the category $\mathbf{FL}$ of finite lattices and monotone…

Category Theory · Mathematics 2021-03-15 Thomas Streicher , Jonathan Weinberger

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

Logic in Computer Science · Computer Science 2018-05-02 Thierry Coquand , Simon Huber , Anders Mörtberg

We describe a homotopical version of the relational and gluing models of type theory, and generalize it to inverse diagrams and oplax limits. Our method uses the Reedy homotopy theory on inverse diagrams, and relies on the fact that Reedy…

Category Theory · Mathematics 2019-02-20 Michael Shulman

This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…

Logic · Mathematics 2022-12-22 Egbert Rijke

The homotopical approach to intensional type theory views proofs of equality as paths. We explore what is required of an object $I$ in a topos to give such a path-based model of type theory in which paths are just functions with domain $I$.…

Logic in Computer Science · Computer Science 2023-06-22 Ian Orton , Andrew M. Pitts

A slight modification to one of Tarski's axioms of plane Euclidean geometry is proposed. This modification allows another of the axioms to be omitted from the set of axioms and proven as a theorem. This change to the system of axioms…

Logic · Mathematics 2013-06-04 Timothy Makarios

We offer an introduction for mathematicians to the univalent foundations of Vladimir Voevodsky, aiming to explain how he chose to encode mathematics in type theory and how the encoding reveals a potentially viable foundation for all of…

Logic · Mathematics 2018-03-12 Daniel R. Grayson

We provide a formulation of the univalence axiom in a universe category model of dependent type theory that is convenient to verify in homotopy-theoretic settings. We further develop a strengthening of the univalence axiom, called pointed…

Logic in Computer Science · Computer Science 2025-12-19 Chris Kapulkin , Yufeng Li

The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a…

Category Theory · Mathematics 2022-08-31 Benedikt Ahrens , Paige Randall North , Michael Shulman , Dimitris Tsementzis

Following a project of developing conventions and notations for informal type theory carried out in the homotopy type theory book for a framework built out of an augmentation of constructive type theory with axioms governing…

Logic in Computer Science · Computer Science 2018-06-25 Bruno Bentzen

The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…

Logic in Computer Science · Computer Science 2017-03-14 Robin Adams , Marc Bezem , Thierry Coquand

This paper will develop a single framework for unifying, simplifying and extending our prior results about axiom systems that retain a partial knowledge of their own consistency, via an axiomatic declaration of self-consistency. Its perhaps…

Logic · Mathematics 2012-01-04 Dan E. Willard

We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Paolo Capriotti , Régis Spadotti

We develop a denotational semantics for general reference types in an impredicative version of guarded homotopy type theory, an adaptation of synthetic guarded domain theory to Voevodsky's univalent foundations. We observe for the first…

Logic in Computer Science · Computer Science 2023-11-22 Jonathan Sterling , Daniel Gratzer , Lars Birkedal

We construct a new model category presenting the homotopy theory of presheaves on "inverse EI $(\infty,1)$-categories", which contains universe objects that satisfy Voevodsky's univalence axiom. In addition to diagrams on ordinary inverse…

Algebraic Topology · Mathematics 2017-03-30 Michael Shulman

It is known that one can construct non-parametric functions by assuming classical axioms. Our work is a converse to that: we prove classical axioms in dependent type theory assuming specific instances of non-parametricity. We also address…

Logic in Computer Science · Computer Science 2017-06-28 Auke Bart Booij , Martín Hötzel Escardó , Peter LeFanu Lumsdaine , Michael Shulman

The usual homogeneous form of equality type in Martin-L\"of Type Theory contains identifications between elements of the same type. By contrast, the heterogeneous form of equality contains identifications between elements of possibly…

Logic in Computer Science · Computer Science 2022-03-15 Andrew M. Pitts

In this note we interpret Voevodsky's Univalence Axiom in the language of (abstract) model categories. We then show that any posetal locally Cartesian closed model category $Qt$ in which the mapping $Hom^{(w)}(Z\times B,C):Qt\longrightarrow…

Category Theory · Mathematics 2011-11-16 Misha Gavrilovich , Assaf Hasson , Itay Kaplan

The basic disentanglement theorem established by the present authors states that estimates on a weighted geometric mean over (convex) families of functions can be disentangled into quantitatively linked estimates on each family separately.…

Functional Analysis · Mathematics 2023-07-06 Anthony Carbery , Timo S. Hänninen , Stefán Ingi Valdimarsson