Partially-elementary end extensions of countable admissible sets
Zachiri McKenzie

TL;DR
This paper explores the transferability of properties from countable admissible sets to their partially-elementary end extensions, revealing limitations and conditions under which such extensions preserve certain theories.
Contribution
It demonstrates that some admissible sets lack certain elementary end extensions, but also shows conditions where such extensions do exist, clarifying the boundaries of transferability.
Findings
Some admissible sets with full separation lack certain elementary end extensions.
Existence of elementary end extensions depends on the theory and properties satisfied by the set.
Conditions for the existence of elementary end extensions are characterized in terms of $ ext{Pi}_n$-Collection and other properties.
Abstract
A result of Kaufmann shows that if is countable, admissible and satisfies , then has a proper -elementary end extension. This paper investigates to what extent the theory that holds in can be transferred to the partially-elementary end extensions guaranteed by Kaufmann's result. We show that there are satisfying full separation, powerset and that have no proper -elementary end extension satisfying either or . In contrast, we show that if is a countable admissible set that satisfies and is a recursively enumerable theory that holds in , then has a proper -elementary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Philosophy and Theoretical Science · Logic, Reasoning, and Knowledge
