Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
The category of iterative sets in homotopy type theory and univalent foundations
Stockholms universitet, Naturvetenskapliga fakulteten, Matematiska institutionen.
Rekke forfattare: 42024 (engelsk)Inngår i: Mathematical Structures in Computer Science, ISSN 0960-1295, E-ISSN 1469-8072, Vol. 34, nr 9, s. 945-970Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
2024. Vol. 34, nr 9, s. 945-970
Emneord [en]
internal models, Set universes, type theory, univalent foundations
HSV kategori
Identifikatorer
URN: urn:nbn:se:su:diva-241635DOI: 10.1017/S0960129524000288ISI: 001373719400001Scopus ID: 2-s2.0-85210281683OAI: oai:DiVA.org:su-241635DiVA, id: diva2:1950038
Tilgjengelig fra: 2025-04-04 Laget: 2025-04-04 Sist oppdatert: 2025-04-04bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus
Av organisasjonen
I samme tidsskrift
Mathematical Structures in Computer Science

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 48 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf