Metraipolis › archive › dc_7084ed87ff74

Loose Inductive Set Theories — arXiv:2610.41862

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41862
License (as archived)
CC0-1.0
Archived
2026-11-02T05:02:33.469Z
SHA-256 of the archived text
84acae06da152a11725b695c9731408f2b1c10fbe4f7c2158a375292f62172d0
Stable URL of this page
https://metraipolis.com/documento/dc_7084ed87ff74

How to cite

Loose Inductive Set Theories — arXiv:2610.41862 — arXiv (en), https://arxiv.org/abs/2610.41862 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7084ed87ff74 (Metraipolis archive dc_7084ed87ff74, sha256 84acae06da152a11725b695c9731408f2b1c10fbe4f7c2158a375292f62172d0)
BibTeX
@misc{dc7084ed87ff74,
  title = {Loose Inductive Set Theories — arXiv:2610.41862},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41862},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7084ed87ff74; sha256 84acae06da152a11725b695c9731408f2b1c10fbe4f7c2158a375292f62172d0},
  year = {2026}
}

Archived text

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

We prove that KP, with Full Set Induction, is neither solid nor tight. More generally, every consistent theory obtained from KPC by adding a quantifier bounded set of sentences has a model with a parameter-free definable class surjection from its natural numbers onto its universe. Using such enumerations to define generic extensions by relative interpretations, we show that theories with the stable definable ground property are not tight. Ground definability over MOST and continuum coding over ZFC^{\Pi_3} yield applications to weak inductive set theories with large cardinals and forcing axioms. Finally, solidity for quantifier bounded extensions of MOST with Full Set Induction implies a Ground Axiom formulated using a fixed finite level of genericity; under the same solidity hypothesis, the corresponding extension of full ZFC proves the ordinary Ground Axiom.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2610.41862 — 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-11-02T04:48:28.144Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).