Abstract
C-systems were defined by Cartmell as models of generalized algebraic theories. B-systems were defined by Voevodsky in his quest to formulate and prove an initiality conjecture for type theories. They play a crucial role in Voevodsky's construction of a syntactic C-system from a term monad. In this work, we construct an equivalence between the category of C-systems and the category of B-systems, thus proving a conjecture by Voevodsky.
| Original language | English |
|---|---|
| Pages (from-to) | 1513-1521 |
| Journal | Journal of Symbolic Logic |
| Volume | 89 |
| Issue number | 4 |
| Early online date | 2023 |
| DOIs | |
| Publication status | Published - Dec 2024 |
Bibliographical note
Publisher Copyright:© 2023 Cambridge University Press. All rights reserved.
Keywords
- ontextual categories
- Martin-Löf type theory
- semantics of type theory
- B-systems
- C-systems
Fingerprint
Dive into the research topics of 'B-systems and C-systems are equivalent'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver