2019
DOI: 10.1007/s00029-019-0480-0
|View full text |Cite
|
Sign up to set email alerts
|

Internal languages of finitely complete $$(\infty , 1)$$ ( ∞ , 1 ) -categories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…Since this paper was first made publicly available in 2016, a part of Conjecture 3.7 was proven in [KS17]. Specifically, the ∞-category Lex ∞ is shown there to be equivalent to the ∞-category of comprehension categories with Id, 1, Σ-types, which reduces the conjecture to a comparison between contextual categories and comprehension categories with the appropriate structure.…”
Section: : Cxlcat Hottmentioning
confidence: 93%
“…Since this paper was first made publicly available in 2016, a part of Conjecture 3.7 was proven in [KS17]. Specifically, the ∞-category Lex ∞ is shown there to be equivalent to the ∞-category of comprehension categories with Id, 1, Σ-types, which reduces the conjecture to a comparison between contextual categories and comprehension categories with the appropriate structure.…”
Section: : Cxlcat Hottmentioning
confidence: 93%
“…The composition of the front square 2-cells κ : (12), and hence a natural equivalence in virtue of the associated Beck-Chevalley condition. We obtain two homotopy-commutative squares in Fun(I ∂∆ 1 , C) as follows.…”
Section: Higher Covering Diagramsmentioning
confidence: 99%
“…Now, the circumstance that formulas are modelled as subobjects is an immediate consequence of proof-irrelevance (and consequently extensionality) of first-order logic. In the ∞-categorical context of cartesian ∞-categories with possibly more logical structure however, the internal languages are proof-relevant and non-extensional type theories ( [12], [11], [18]), and hence require the modelling of formulas as type families which are generally far from being monic. On the flipside, this poses the question what notion of topology ought to be considered to reflect this.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, homotopy type theory (The Univalent Foundations Program 2013) is expected to provide an internal language for what should be called "elementary (∞, 1)-toposes." As a first step, Kapulkin and Szumiło (2019) showed that there is an equivalence between intensional Martin-Löf theories and finitely complete (∞, 1)-categories.…”
Section: Introductionmentioning
confidence: 99%