English
Related papers

Related papers: The univalence axiom in cubical sets

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

We study properties of the cubical Joyal model structures on cubical sets by means of a combinatorial construction which allows for convenient comparisons between categories of cubical sets with and without symmetries. In particular, we…

Algebraic Topology · Mathematics 2026-02-25 Brandon Doherty

In Feferman's work, explicit mathematics and theories of generalized inductive definitions play a central role. One objective of this article is to describe the connections with Martin-Lof type theory and constructive Zermelo-Fraenkel set…

Logic · Mathematics 2018-01-08 Michael Rathjen

Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and…

Logic · Mathematics 2013-08-06 The Univalent Foundations Program

Univalence was first defined in the setting of homotopy type theory by Voevodsky, who also (along with Kapulkin and Lumsdaine) adapted it to a model categorical setting, which was subsequently generalized to locally Cartesian closed…

Category Theory · Mathematics 2021-03-31 Nima Rasekh

Many introductions to homotopy type theory and the univalence axiom gloss over the semantics of this new formal system in traditional set-based foundations. This expository article, written as lecture notes to accompany a 3-part mini course…

Category Theory · Mathematics 2024-03-04 Emily Riehl

A typoid is a type equipped with an equivalence relation, such that the terms of equivalence between the terms of the type satisfy certain conditions, with respect to a given equivalence relation between them, that generalise the properties…

Category Theory · Mathematics 2022-05-16 Iosif Petrakis

We exhibit a computational type theory which combines the higher-dimensional structure of cartesian cubical type theory with the internal parametricity primitives of parametric type theory, drawing out the similarities and distinctions…

Logic in Computer Science · Computer Science 2019-07-10 Evan Cavallo , Robert Harper

We propose a new cubical type theory, termed (self-deprecatingly) the naive cubical type theory, and study its semantics using the universe category framework, which is similar to Uemura's categories with representable morphisms. In…

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

Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…

Logic in Computer Science · Computer Science 2026-03-16 Yunsong Yang , Simon Guilloud , Viktor Kunčak

This is the third in a series of papers extending Martin-L\"of's meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higher-dimensional types. We extend this framework to include a…

Logic in Computer Science · Computer Science 2017-12-06 Carlo Angiuli , Kuen-Bang Hou , Robert Harper

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

It is well known that univalence is incompatible with uniqueness of identity proofs (UIP), the axiom that all types are h-sets. This is due to finite h-sets having non-trivial automorphisms as soon as they are not h-propositions. A natural…

Logic in Computer Science · Computer Science 2020-05-04 Christian Sattler , Andrea Vezzosi

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

Logic in Computer Science · Computer Science 2018-01-23 David McAllester

The set-theoretic axiom WISC states that for every set there is a set of surjections to it cofinal in all such surjections. By constructing an unbounded topos over the category of sets and using an extension of the internal logic of a topos…

Category Theory · Mathematics 2015-08-27 David Michael Roberts

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…

Logic in Computer Science · Computer Science 2017-04-21 Thierry Coquand , Bassel Mannaa , Fabian Ruch

We introduce a single-set axiomatisation of cubical $\omega$-categories, including connections and inverses. We justify these axioms by establishing a series of equivalences between the category of single-set cubical $\omega$-categories,…

Logic in Computer Science · Computer Science 2024-07-08 Philippe Malbos , Tanguy Massacrier , Georg Struth

This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…

Algebraic Topology · Mathematics 2021-09-20 Sanjeevi Krishnan , Crichton Ogle

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

By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type which is able to encode a number of fully coherent algebraic structures. In…

Logic in Computer Science · Computer Science 2021-05-04 Antoine Allioux , Eric Finster , Matthieu Sozeau