arXiv (All)
open access
The Limits of Arithmetical Pluralism: Incompleteness, Large Cardinals, and Graded Non-Pluralism
Gödelian incompleteness yields arithmetical sentences $A$ such that $PA+A$ and $PA+\neg A$ are both consistent. Are such extensions equally legitimate? I propose graded epistemic arithmetical non-pluralism: justification for choosing between them varies with the set-theoretic strength of $A$. I defe
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
- The Effect of EPub-Assisted Teaching Materials to Improve Students’ Numeracy Ability#264897
- Mathematics, quantifiers, connectives, multiple models#733336
- “Truth-preserving and consequence-preserving deduction rules”#712331
- Theories as recipes: third-order virtue and vice#752526
- The Consequentializing Argument Against...Consequentializing?#74548
Record · ID 1037480
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