Linear ROD subsets of Borel partial orders are countably cofinal in the Solovay model
Vladimir Kanovei

TL;DR
In the Solovay model, Borel partial orders restricted to ROD linearly ordered subsets are countably cofinal, and under certain conditions, these orders lack maximal ROD chains.
Contribution
The paper proves that in the Solovay model, ROD subsets of Borel partial orders have countably cofinal restrictions and identifies conditions for the absence of maximal ROD chains.
Findings
ROD subsets of Borel partial orders are countably cofinal in the Solovay model.
If every countable set has a strict upper bound, no maximal ROD chains exist.
Results are specific to the properties of the Solovay model.
Abstract
The following is true in the Solovay model. 1. If is a Borel partial order on a set of the reals, and is a ROD subset of linearly ordered by , then the restriction of onto is countably cofinal. 2. If in addition every countable set of has a strict upper bound in the sense of then the ordering has no maximal chains that are ROD sets.
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.
