Symmetric Iterations with Countable and $<\kappa$-Support: A Framework for Choiceless ZF Extensions
Frank Gilson

TL;DR
This paper introduces a comprehensive framework for iterated symmetric extensions with various support sizes, enabling the construction of models of ZF with controlled choice principles and adding reals without collapsing cardinals.
Contribution
It develops a unified approach to symmetric iterations with countable and smaller support, extending to class-length iterations and handling singular cardinals with new fusion techniques.
Findings
Constructs models of ZF with added reals and no AC
Preserves ZF and certain choice principles under complex iterations
Introduces new fusion methods for singular cardinals
Abstract
We develop a unified framework for iterated symmetric extensions with countable support and, more generally, with -support. Set-length iterations are treated uniformly, and when the iteration template is first-order definable over a Godel-Bernays ground with Global Choice, the construction extends to class-length iterations. At limit stages with we use direct limits; when we use inverse-limit presentations via trees of conditions together with tuple-stabilizer symmetry filters. The resulting limit filters are normal and -complete, yielding closure of hereditarily symmetric names and preservation of . Under a -Baire (strategic closure) hypothesis we obtain , and under a Localization hypothesis we obtain . In the countable-support setting we give an…
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
TopicsGame Theory and Voting Systems · Logic, Reasoning, and Knowledge · Logic, programming, and type systems
