English
Related papers

Related papers: (Pointed) Univalence in Universe Category Models o…

200 papers

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

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

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

A hierarchy of type universes is a rudimentary ingredient in the type theories of many proof assistants to prevent the logical inconsistency resulting from combining dependent functions and the type-in-type rule. In this work, we argue that…

Programming Languages · Computer Science 2024-04-09 Jonathan Chan , Stephanie Weirich

We construct a univalent universe in the sense of Voevodsky in some suitable model categories for homotopy types (obtained from Grothendieck's theory of test categories). In practice, this means for instance that, appart from the homotopy…

Algebraic Topology · Mathematics 2014-06-03 Denis-Charles Cisinski

In this note we show that Voevodsky's univalence axiom holds in the model of type theory based on symmetric cubical sets. We will also discuss Swan's construction of the identity type in this variation of cubical sets. This proves that we…

Logic · Mathematics 2017-10-31 Marc Bezem , Thierry Coquand , Simon Huber

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 show that Voevodsky's univalence axiom for intensional type theory is valid in categories of simplicial presheaves on elegant Reedy categories. In addition to diagrams on inverse categories, as considered in previous work of the author,…

Algebraic Topology · Mathematics 2015-01-20 Michael Shulman

Homotopy Type Theory with a univalent universe $\,\mathcal{U}_0$ is interpreted at the strength of finite order arithmetic. We eliminate Grothendieck universes, avoid the axiom of replacement, and bound all uses of separation.

Logic · Mathematics 2015-01-13 Colin McLarty

It is a well-known theorem of homotopy type theory, originally due to Voevodsky, that function extensionality holds inside any univalent universe. We consider a weaker variant of the univalence axiom, asserting that the wild category formed…

Logic in Computer Science · Computer Science 2026-05-04 Evan Cavallo , Jonas Höfer

We prove a coherence theorem for invertible objects in a symmetric monoidal category. This is used to deduce associativity, skew-commutativity, and related results for multi-graded morphism rings, generalizing the well-known versions for…

Category Theory · Mathematics 2014-10-01 Daniel Dugger

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

In dependent type theory, being able to refer to a type universe as a term itself increases its expressive power, but requires mechanisms in place to prevent Girard's paradox from introducing logical inconsistency in the presence of…

Programming Languages · Computer Science 2025-03-03 Jonathan Chan , Stephanie Weirich

In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…

Category Theory · Mathematics 2023-06-22 Valery Isaev

We define a simple dependent type theory and prove that its well-formed types correspond exactly to finite inverse categories.

Logic · Mathematics 2017-07-25 Dimitris Tsementzis , Matthew Weaver

The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly's and Mac Lane's…

Category Theory · Mathematics 2007-05-23 K. Dosen , Z. Petric

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

This PhD thesis deals with some new models of intensional type theory and the Univalence Axiom introduced by Vladimir Voevodsky. Our work takes place in the framework of the definitions of type-theoretic fibration categories (the notion of…

Category Theory · Mathematics 2016-04-13 Anthony Bordg

We combine Homotopy Type Theory with axiomatic cohesion, expressing the latter internally with a version of "adjoint logic" in which the discretization and codiscretization modalities are characterized using a judgmental formalism of "crisp…

Category Theory · Mathematics 2017-04-26 Michael Shulman

This paper investigates Voevodsky's univalence axiom in intensional Martin-L\"of type theory. In particular, it looks at how univalence can be derived from simpler axioms. We first present some existing work, collected together from various…

Logic in Computer Science · Computer Science 2019-11-20 Ian Orton , Andrew M. Pitts
‹ Prev 1 2 3 10 Next ›