Partially-elementary end extensions of countable models of set theory
Zachiri McKenzie

TL;DR
This paper investigates the limitations of transferring theories to end extensions of countable models of set theory, showing that certain theories can be preserved in specific elementary end extensions using advanced techniques.
Contribution
It demonstrates the bounds of theory transfer in end extensions of models of set theory and introduces methods to control which theories are preserved.
Findings
Proper $ ext{Σ}_n$-elementary end extensions exist for models with certain theories.
Theories like $ ext{Π}_n$-Collection and $ ext{Π}_{n+1}$-Foundation influence the strength of end extensions.
The results connect model-theoretic properties with proof-theoretic strength of set theories.
Abstract
Let denote Kripke-Platek Set Theory and let be the weak set theory obtained from by removing the collection scheme, restricting separation to -formulae and adding an axiom asserting that every set is contained in a transitive set (). A result due to Kaufmann shows that every countable model, , of has a proper -elementary end extension. Here we show that there are limits to the amount of the theory of that can be transferred to the end extensions that are guaranteed by Kaufmann's Theorem. Using admissible covers and the Barwise Compactness Theorem, we show that if is a countable model and is a recursive theory that holds in , then there…
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 · Computability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge
