English
Related papers

Related papers: Partial Univalence in n-truncated Type Theory

200 papers

We study invariant types in NIP theories. Amongst other things: we prove a definable version of the (p,q)-theorem in theories of small or medium directionality; we construct a canonical retraction from the space of M-invariant types to that…

Logic · Mathematics 2015-11-10 Pierre Simon

Reasoning modulo equivalences is natural for everyone, including mathematicians. Unfortunately, in proof assistants based on type theory, equality is appallingly syntactic and, as a result, exploiting equivalences is cumbersome at best.…

Programming Languages · Computer Science 2020-10-16 Nicolas Tabareau , Éric Tanter , Matthieu Sozeau

Brouwer's constructivist foundations of mathematics is based on an intuitively meaningful notion of computation shared by all mathematicians. Martin-L\"of's meaning explanations for constructive type theory define the concept of a type in…

Logic in Computer Science · Computer Science 2016-06-15 Carlo Angiuli , Robert Harper , Todd Wilson

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

In this paper, we establish a theorem that proves a condition when an inclusion morphism between simplicial sets becomes a weak homotopy equivalence. Additionally, we present two applications of this result. The first application…

Algebraic Topology · Mathematics 2024-05-07 Hisato Matsukawa

It is a famous open question whether every integrally closed reflexive polytope has a unimodal Ehrhart delta-vector. We generalize this question to arbitrary integrally closed lattice polytopes and we prove unimodality for the delta-vector…

Combinatorics · Mathematics 2011-10-18 Jan Schepers , Leen Van Langenhoven

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…

Logic · Mathematics 2015-04-21 Richard Zach

Pudl\'ak [Pud17] lists several major conjectures from the field of proof complexity and asks for oracles that separate corresponding relativized conjectures. Among these conjectures are: - $\mathsf{DisjNP}$: The class of all disjoint…

Computational Complexity · Computer Science 2020-01-10 Titus Dose

In homotopy type theory we can define the join of maps as a binary operation on maps with a common co-domain. This operation is commutative, associative, and the unique map from the empty type into the common codomain is a neutral element.…

Category Theory · Mathematics 2017-01-27 Egbert Rijke

We prove that every categorical model of dependent type theory with dependent sums and products, intensional identity types and univalent universes presents via its $\infty$-localisation an elementary $\infty$-topos, that is, a finitely…

Category Theory · Mathematics 2026-04-30 Maximilian Petrowitsch

We prove a conservativity result for extensional type theories over propositional ones, i.e. dependent type theories with propositional computation rules, or computation axioms, using insights from homotopy type theory. The argument…

Logic · Mathematics 2025-10-01 Matteo Spadetto

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 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 give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…

Logic in Computer Science · Computer Science 2015-02-23 Andrew Polonsky

In this paper an algebraic model for unbased rational homotopy theory from the perspective of curved Lie algebras is constructed. As part of this construction a model structure for the category of pseudo-compact curved Lie algebras with…

Algebraic Topology · Mathematics 2018-01-16 James Maunder

Let $p$ be a prime number, let $d$ be an integer and let $G$ be a $d$-generated finite $p$-group of nilpotency class smaller than $p$. Then the number of possible isomorphism types for the mod $p$ cohomology algebra $H^*(G;{\mathbb F}_p)$…

Group Theory · Mathematics 2016-12-21 Antonio Díaz Ramos , Oihana Garaialde Ocaña , Jon González-Sánchez

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

We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…

Algebraic Topology · Mathematics 2012-07-20 Mark Grant , Gregory Lupton , John Oprea

In this short note we give a glimpse of homotopy type theory, a new field of mathematics at the intersection of algebraic topology and mathematical logic, and we explain Vladimir Voevodsky's univalent interpretation of it. This…

History and Overview · Mathematics 2013-02-20 Steve Awodey , Álvaro Pelayo , Michael A. Warren

The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of…

Computational Complexity · Computer Science 2017-01-09 Hubie Chen , Benoit Larose