Donder's Version of Revised Countable Support

Abstract

Shelah introduced the revised countable support (RCS) iteration to iterate semiproperness. This was an endpoint in the search for an iteration of a weak condition, still implying that aleph1 is preserved. Dieter Donder found a better manageable approach to this iteration, which is presented here.

Cited by in corpus (3)

• A Boolean Algebraic Approach to Semiproper Iterations
• Category forcings, $M{M}^{+++}$, and generic absoluteness for the theory of strong forcing axioms
• Iteration of Semiproper Forcing Revisited