Forcing With Copies of Countable Ordinals
Abstract
Let α be a countable ordinal and (α) the collection of its subsets isomorphic to α. We show that the separative quotient of the set (α) ordered by the inclusion is isomorphic to a forcing product of iterated reduced products of Boolean algebras of the form P(ω γ)/I(ω γ), where γ is a limit ordinal or 1 and I(ω γ) the corresponding ordinal ideal. Moreover, the poset (α) is forcing equivalent to a two-step iteration P(ω)/Fin * π, where π is an ω1-closed separative pre-order in each extension by P(ω)/Fin and, if the distributivity number is equal toω1, to P(ω)/Fin. Also we analyze the quotients over ordinal ideals P(ω δ)/I(ω δ) and their distributivity and tower numbers.
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.