B-systems and C-systems are equivalent

Journal Article (2023)
Author(s)

Benedikt Ahrens (University of Birmingham, TU Delft - Electrical Engineering, Mathematics and Computer Science)

Jacopo Emmenegger (UniversitĂ  degli Studi di Genova)

Paige Randall North (Universiteit Utrecht)

Egbert Rijke (University of Ljubljana)

Research Group
Programming Languages
DOI related publication
https://doi.org/10.1017/jsl.2023.41 Final published version
More Info
expand_more
Publication Year
2023
Language
English
Research Group
Programming Languages
Journal title
Journal of Symbolic Logic
Issue number
4
Volume number
89 (2024)
Pages (from-to)
1513-1521
Downloads counter
235
Collections
Institutional Repository
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

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.