๐ฎ
๐ฎ
The Ethereal
When is the partial map classifier a Sierpiลski cone?
April 09, 2025 ยท The Ethereal ยท ๐ Logic in Computer Science
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Leoni Pugh, Jonathan Sterling
arXiv ID
2504.06789
Category
cs.LO: Logic in CS
Cross-listed
cs.PL,
math.CT
Citations
1
Venue
Logic in Computer Science
Last Checked
5 months ago
Abstract
We study the relationship between partial map classifiers, Sierpiลski cones, and axioms for synthetic higher categories and domains within univalent foundations. In particular, we show that synthetic $\infty$-categories are closed under partial map classifiers assuming Phoa's principle, and we isolate a new reflective subuniverse of types within which the Sierpiลski cone (a lax colimit) can be computed as a partial map classifier by strengthening the Segal condition.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal