Metraipolis › archive › dc_7f6683bfb54a

The Limits of Arithmetical Pluralism: Incompleteness, Large Cardinals, and Graded Non-Pluralism — arXiv:2609.22797

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.22797
License (as archived)
CC0-1.0
Archived
2026-10-09T21:57:55.149Z
SHA-256 of the archived text
28d44949988e7812614292574670b906d0a17c95aceae3f539d6c7925314014c
Stable URL of this page
https://metraipolis.com/documento/dc_7f6683bfb54a

How to cite

The Limits of Arithmetical Pluralism: Incompleteness, Large Cardinals, and Graded Non-Pluralism — arXiv:2609.22797 — arXiv (en), https://arxiv.org/abs/2609.22797 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7f6683bfb54a (Metraipolis archive dc_7f6683bfb54a, sha256 28d44949988e7812614292574670b906d0a17c95aceae3f539d6c7925314014c)
BibTeX
@misc{dc7f6683bfb54a,
  title = {The Limits of Arithmetical Pluralism: Incompleteness, Large Cardinals, and Graded Non-Pluralism — arXiv:2609.22797},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.22797},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7f6683bfb54a; sha256 28d44949988e7812614292574670b906d0a17c95aceae3f539d6c7925314014c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.22797. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 defend $PA+Con(PA)$ and show Koellner's non-pluralism for first-order arithmetic is inadequate given Friedman's concrete incompleteness. Resolving the selection problem for such sentences turns on justifying large cardinals. Defending graded non-pluralism thus engages Gödel's programme and the justification of very large cardinals.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.LO).
Categorie arXiv: Logic (math.LO) ; History and Overview (math.HO).
Pagina del lavoro: https://arxiv.org/abs/2609.22797 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T21:44:20.582Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).