Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The category of iterative sets in homotopy type theory and univalent foundations
Stockholm University, Faculty of Science, Department of Mathematics.
Number of Authors: 42024 (English)In: Mathematical Structures in Computer Science, ISSN 0960-1295, E-ISSN 1469-8072, Vol. 34, no 9, p. 945-970Article in journal (Refereed) Published
Abstract [en]

When working in homotopy type theory and univalent foundations, the traditional role of the category of sets, Set, is replaced by the category hSet of homotopy sets (h-sets); types with h-propositional identity types. Many of the properties of Set hold for hSet ((co)completeness, exactness, local cartesian closure, etc.). Notably, however, the univalence axiom implies that Ob hSet is not itself an h-set, but an h-groupoid. This is expected in univalent foundations, but it is sometimes useful to also have a stricter universe of sets, for example, when constructing internal models of type theory. In this work, we equip the type of iterative sets V0, due to Gylterud ((2018). The Journal of Symbolic Logic 83 (3) 1132-1146) as a refinement of the pioneering work of Aczel ((1978). Logic Colloquium'77, Studies in Logic and the Foundations of Mathematics, vol. 96, Elsevier, 55-66.) on universes of sets in type theory, with the structure of a Tarski universe and show that it satisfies many of the good properties of h-sets. In particular, we organize V 0 into a (non-univalent strict) category and prove that it is locally cartesian closed. This enables us to organize it into a category with families with the structure necessary to model extensional type theory internally in HoTT/UF. We do this in a rather minimal univalent type theory with W-types, in particular we do not rely on any HITs, or other complex extensions of type theory. Furthermore, the construction of V0 and the model is fully constructive and predicative, while still being very convenient to work with as the decoding from V0 into h-sets commutes definitionally for all type constructors. Almost all of the paper has been formalized in Agda using the agda-unimath library of univalent mathematics.

Place, publisher, year, edition, pages
2024. Vol. 34, no 9, p. 945-970
Keywords [en]
internal models, Set universes, type theory, univalent foundations
National Category
Algebra and Logic
Identifiers
URN: urn:nbn:se:su:diva-241635DOI: 10.1017/S0960129524000288ISI: 001373719400001Scopus ID: 2-s2.0-85210281683OAI: oai:DiVA.org:su-241635DiVA, id: diva2:1950038
Available from: 2025-04-04 Created: 2025-04-04 Last updated: 2025-04-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus
By organisation
Department of Mathematics
In the same journal
Mathematical Structures in Computer Science
Algebra and Logic

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 48 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf