English

Decomposing the Univalence Axiom

Logic in Computer Science 2019-11-20 v3

Abstract

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 published and unpublished sources; we then present a new decomposition of the univalence axiom into simpler axioms. We argue that these axioms are easier to verify in certain potential models of univalent type theory, particularly those models based on cubical sets. Finally we show how this decomposition is relevant to an open problem in type theory.

Keywords

Cite

@article{arxiv.1712.04890,
  title  = {Decomposing the Univalence Axiom},
  author = {Ian Orton and Andrew M. Pitts},
  journal= {arXiv preprint arXiv:1712.04890},
  year   = {2019}
}

Comments

18 pages

R2 v1 2026-06-22T23:17:12.980Z