arXiv (All)
open access
Well-ordering principles over recursive comprehension
We establish a general result on the proof-theoretic strength of well-ordering principles in reverse mathematics. The novelty is that our result gives information over base theories as weak as $\mathsf{RCA}_0$, while previous results of Arai, Pakhomov-Walsh and Buriola-Weiermann required the stronge
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
- Some Potential Loopholes for Welfarist Axiology#111470
- Ordinal type theory#92700
- Closed Paths Do Not Imply Temporal Reversal: A Structural Clarification of State Return and Time Ordering#722125
- Fixed-Point Posets in Theories of Truth#750101
- Supervaluationism and Classical Logic#711340
Record · ID 1401509
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