arXiv (All)
open access
A Logspace-Constructive Proof of L=SL
We formalize the proof of Reingold's Theorem that SL=L [Rei05] in the theory of bounded arithmetic VL, which corresponds to ``logspace reasoning''. As a consequence, we get that VL=VSL, where VSL is the theory of bounded arithmetic for ``symmetric-logspace reasoning''. This resolves in the affirmati
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimizing Proof-Search via Linearization for Gödel-Löb Logic with Tree-Hypersequents#1326302
- (Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography#1325635
- Vanilla Rules: the "No Ice Cream" Construction#87119
- Internalizing Meta-Rationality: Rational Worlds, Public Closure and the Conditions of Lawlikeness#98141
- L is different from NP#1234740
Record · ID 1233739
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive