arXiv (All)
open access
Toward a Characterization of Simulation Between Arithmetic Theories
We study when a sound arithmetic theory $\mathcal S{\supseteq}S^1_2$ with polynomial-time decidable axioms has polynomial-size proofs of $Con_{\mathcal S{+}ϕ}(n)$ for a true sentence $ϕ$. Our structural result characterizes the nonexistence of a length-optimal propositional proof system: it is equiv
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
- How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization#670300
- How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization#668235
- Robust Reconstruction on Trees with a Growing Alphabet#1117975
- Three rules of distribution: one counterexample#712354
- When Equivalence Obscures: On Mathematical Reduction, Epistemic Access, and Expository Machines The Jensen–Laguerre route to the Riemann Hypothesis as a case study#91153
Record · ID 1155182
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