Abstract Corrected Iterations
Abstract
We consider (<λ)-support iterations of a version of (<λ)-strategically complete λ+-c.c. definable forcing notions along partial orders. We show that such iterations can be corrected to yield an analog of a result by Judah and Shelah for finite support iterations of Suslin ccc forcing, namely that if (Pα, Qβ : α ≤ δ, β <δ) is a FS iteration of Suslin ccc forcing and U⊂eq δ is sufficiently closed, then letting PU be the iteration along U, we have PU Pδ.
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.