Non-elementary proper forcing
Jakob Kellner
TL;DR
This paper introduces a simplified framework for ord-transitive models and Shelah's non-elementary proper (nep) theory, along with a new construction for countable support nep iteration, advancing the methodology in set theory.
Contribution
It provides a streamlined approach to nep theory and a novel construction for countable support nep iteration, enhancing existing techniques.
Findings
Simplified framework for ord-transitive models
New construction for countable support nep iteration
Advances in non-elementary proper forcing techniques
Abstract
We introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.
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