Long Borel Hierarchies
Arnold W. Miller

TL;DR
The paper demonstrates the relative consistency of the Borel hierarchy on reals having length 2 within ZF set theory, showing that 1 can have countable cofinality and that the hierarchy length can be any limit ordinal less than 2.
Contribution
It constructs models of ZF where the Borel hierarchy reaches various specified lengths, illustrating the hierarchy's potential complexity without the axiom of choice.
Findings
Borel hierarchy can have length 2 in ZF models.
1 can have countable cofinality in these models.
Hierarchy length can be any limit ordinal less than 2.
Abstract
We show that it is relatively consistent with ZF that the Borel hierarchy on the reals has length . This implies that has countable cofinality, so the axiom of choice fails very badly in our model. A similar argument produces models of ZF in which the Borel hierarchy has length any given limit ordinal less than , e.g., or . Latex2e: 24 pages plus 8 page appendix Latest version at: www.math.wisc.edu/~miller
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 · Economic theories and models
