Topological Computational Paths: Presentation Invariance and Observable Quotients
cs.LO, math.AT
Submitted: 2026-08-04
Updated: 2026-11-03
Terminology
Sources
- Formalizing Computational Paths and Fundamental Groups in Lean
- Computational Paths Form a Weak {\omega}-Groupoid
- The Seifert-van Kampen Theorem via Computational Paths: A Formalized Approach to Computing Fundamental Groups
Related papers
- A Non-Dichotomy for CSPs of Stable omega-Categorical Structures
- A Deeper Look at Depth: Stable Generation Accounting for Quantifier Reasoning
- Formalizing Hyperspaces and Operations on Subsets of Polish Spaces over Abstract Exact Real Numbers
- A Diagrammatic Basis for Computer Programming
- Interpolation via Generalized Splitting
- Staying Productive Under the Palm Trees: On Graded Coeffect Typing in the Tropical Semiring