Recognition: unknown
Donder's Version of Revised Countable Support
classification
🧮 math.LO
keywords
iterationcountabledonderrevisedsupportaleph1approachbetter
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
A Topological Rainbow Ramsey Theorem
It is consistent relative to suitable large cardinals that any countable-to-one coloring of pairs from ω₂ admits an injective restriction to some closed subset of order type ω₁.
-
A Topological Rainbow Ramsey Theorem
It is consistent relative to large cardinals that every countable-to-one coloring c of pairs from ω₂ has a closed subset A of order type ω₁ on which c is injective.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.