Loose Inductive Set Theories
Abstract
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^{Π_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.
Related
- Hitting time for loose Hamilton cycles in the random hypergraph process
- Uniform Hypergraphs with α-Spectral Radius at Most That of a Loose Cycle
- Intersecting families of loose spanning hypertrees
- The inductive Navarro-Alperin weight condition for the Suzuki and Ree groups
- Nice Partitions of Signed-Graphic Arrangements Are Inductive Factorizations
BibTeX
@misc{glazer2026loose,
title = {{Loose Inductive Set Theories}},
author = {Elliot Glazer and Toby Meadows},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.41862},
eprint = {2610.41862},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.41862},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Loose Inductive Set Theories
AU - Elliot Glazer
AU - Toby Meadows
PY - 2026
DA - 2026/10/30
PB - arXiv
DO - 10.48550/arxiv.2610.41862
UR - https://arxiv.org/abs/2610.41862
AB - 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^{Π_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.
ER -