The largest subuniverse where the Sierpiński cone classifies partial maps is the accessible localisation at interval-parameterised embeddings, strictly contained in Segal types for non-trivial intervals.
Limits and colimits in synthetic∞-categories.Mathematical Structures in Computer Science, 35:e24, 2025
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Synthetic Sierpi\'nski Cone
The largest subuniverse where the Sierpiński cone classifies partial maps is the accessible localisation at interval-parameterised embeddings, strictly contained in Segal types for non-trivial intervals.