External univalence for second-order generalized algebraic theories

11/14/2022
by   Rafaël Bocquet, et al.
0

Voevodsky's univalence axiom is often motivated as a realization of the equivalence principle; the idea that equivalent mathematical structures satisfy the same properties. Indeed, in Homotopy Type Theory, properties and structures can be transported over type equivalences. However, we may wish to explain the equivalence principle without relying on the univalence axiom. For example, all type formers preserve equivalences in most type theories; thus it should be possible to transport structures over type equivalences even in non-univalent type theories. We define external univalence, a property of type theories (and more general second-order generalized algebraic theories) that captures the preservation of equivalences (or other homotopy relations). This property is defined syntactically, as the existence of identity types on the (syntactically defined) coclassifying (Sigma,Pi_rep)-CwF (also called generic model or walking model) of the theory. Semantically, it corresponds to the existence of some left semi-model structure on the category of models of the theory. We give syntactic conditions that can be used to check that a theory satisfies external univalence. We prove external univalence for some theories, such as the first-order generalized algebraic theory of categories, and dependent type theory with any standard choice of type formers and axioms, including identity types, Sigma-types, Pi-types, universes à la Tarski, the univalence axiom, the Uniqueness of Identity Proofs axiom, etc.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2018

Morita equivalences between algebraic dependent type theories

We define a notion of equivalence between algebraic dependent type theor...
research
04/20/2023

Towards coherence theorems for equational extensions of type theories

We study the conservativity of extensions by additional strict equalitie...
research
12/27/2022

Foundations of self-progressive choice theories

Consider a population of agents whose choice behaviors are partially com...
research
11/29/2021

Formalization of dependent type theory: The example of CaTT

We present the type theory CaTT, originally introduced by Finster and Mi...
research
01/18/2018

A universality theorem for allowable sequences with applications

Order types are a well known abstraction of combinatorial properties of ...
research
04/14/2020

A Higher Structure Identity Principle

The ordinary Structure Identity Principle states that any property of se...
research
02/24/2022

Strict universes for Grothendieck topoi

Hofmann and Streicher famously showed how to lift Grothendieck universes...

Please sign up or login with your details

Forgot password? Click here to reset