English
Related papers

Related papers: External univalence for second-order generalized a…

200 papers

In their usual form, representation independence metatheorems provide an external guarantee that two implementations of an abstract interface are interchangeable when they are related by an operation-preserving correspondence. If our…

Programming Languages · Computer Science 2025-06-11 Carlo Angiuli , Evan Cavallo , Anders Mörtberg , Max Zeuner

We discuss how canonical and universal constructions, properties and characterizations interact with equality in the framework of Homotopy Type Theory, comparing it with Grothendieck's use of equality and shedding further light on…

Logic · Mathematics 2026-04-02 Thomas Eckl

We will give a detailed account of why the simplicial sets model of the univalence axiom due to Voevodsky also models W-types. In addition, we will discuss W-types in categories of simplicial presheaves and an application to models of set…

Category Theory · Mathematics 2015-11-26 Benno van den Berg , Ieke Moerdijk

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 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

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

Univalence, originally a type theoretical notion at the heart of Voevodsky's Univalent Foundations Program, has found general importance as a higher categorical property that characterizes descent and hence classifying maps in…

Category Theory · Mathematics 2022-11-15 Raffael Stenzel

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

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

In a recent paper, the second author and Joana Cirici proved a theorem that says that given appropriate hypotheses, $n$-formality of a differential graded algebraic structure is equivalent to the existence of a chain-level lift of a…

Algebraic Topology · Mathematics 2022-09-23 Gabriel C. Drummond-Cole , Geoffroy Horel

We propose global surjectivity theorems of differentiable maps based on second order conditions. Using the homotopy continuation method, we demonstrate that, for a $C^2$ differentiable map from a Hilbert space to a finite-dimensional…

Classical Analysis and ODEs · Mathematics 2025-10-14 Yacine Chitour , Zhengping Ji , Emmanuel Trélat

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 define and develop two-level type theory (2LTT), a version of Martin-L\"of type theory which combines two different type theories. We refer to them as the inner and the outer type theory. In our case of interest, the inner theory is…

Logic in Computer Science · Computer Science 2026-05-27 Danil Annenkov , Paolo Capriotti , Nicolai Kraus , Christian Sattler

The non-standard identity concept developed in the Homotopy Type theory allows for an alternative analysis of Frege's famous Venus example, which explains how empirical evidences justify judgements about identities and accounts for the…

History and Overview · Mathematics 2012-06-11 Andrei Rodin

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

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

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

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

Operator Algebras · Mathematics 2018-12-31 Greg Friedman , Efton Park

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

Logic · Mathematics 2010-12-07 Hector Pasten , Thanases Pheidas , Xavier Vidaux

This paper develops a version of dependent type theory in which isomorphism is handled through a direct generalization of the 1939 definitions of Bourbaki. More specifically we generalize the Bourbaki definition of structure from simple…

Logic in Computer Science · Computer Science 2021-04-20 David McAllester