On countable cofinality and decomposition of definable thin orderings
Abstract
We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and 12 thin sets in the assumption that ω1L[x]<ω1 for all reals x. We also prove that definable thin wellorderings admit partitions into definable chains in the Solovay model.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.