B-Systems and C-Systems Are Equivalent

Journal of Symbolic Logic:1-9 (forthcoming)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Paraconsistency, self-extensionality, modality.Arnon Avron & Anna Zamansky - 2020 - Logic Journal of the IGPL 28 (5):851-880.
Behavioral algebraization of da Costa's C-systems.Carlos Caleiro & Ricardo Gonçalves - 2009 - Journal of Applied Non-Classical Logics 19 (2):127-148.

Analytics

Added to PP
2023-08-20

Downloads
11 (#1,150,279)

6 months
6 (#702,272)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jacopo Emmenegger
Stockholm University

Citations of this work

No citations found.

Add more citations

References found in this work

Generalised algebraic theories and contextual categories.John Cartmell - 1986 - Annals of Pure and Applied Logic 32:209-243.

Add more references