The internal languages of univalent categories
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915645954719744 |
|---|---|
| author | van der Weide, Niels |
| author_facet | van der Weide, Niels |
| contents | Internal language theorems are fundamental in categorical logic, since they express an equivalence between syntax and semantics. One of such theorems was proven by Clairambault and Dybjer, who corrected the result originally by Seely. More specifically, they constructed a biequivalence between the bicategory of locally Cartesian closed categories and the bicategory of democratic categories with families with extensional identity types, $\sum$-types, and $\prod$-types. This theorem expresses that the internal language of locally Cartesian closed categories is extensional Martin-Löf type theory with dependent sums and products. In this paper, we study the theorem by Clairambault and Dybjer for univalent categories, and we extend it to various classes of toposes, among which are $\prod$-pretoposes, elementary toposes, and elementary toposes with a universe. The results in this paper have been formalized using the proof assistant Rocq and the UniMath library. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_06636 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The internal languages of univalent categories van der Weide, Niels Category Theory Logic in Computer Science Internal language theorems are fundamental in categorical logic, since they express an equivalence between syntax and semantics. One of such theorems was proven by Clairambault and Dybjer, who corrected the result originally by Seely. More specifically, they constructed a biequivalence between the bicategory of locally Cartesian closed categories and the bicategory of democratic categories with families with extensional identity types, $\sum$-types, and $\prod$-types. This theorem expresses that the internal language of locally Cartesian closed categories is extensional Martin-Löf type theory with dependent sums and products. In this paper, we study the theorem by Clairambault and Dybjer for univalent categories, and we extend it to various classes of toposes, among which are $\prod$-pretoposes, elementary toposes, and elementary toposes with a universe. The results in this paper have been formalized using the proof assistant Rocq and the UniMath library. |
| title | The internal languages of univalent categories |
| topic | Category Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2411.06636 |