Add(ω, ω_ω) forces maximal n-ladders to have size ℵ_{n-1} for every n, answering Ditor's question positively, while also establishing consistency results for n=3 under d=ℵ_1, clubsuit, and diamond.
Iterated forcing and elementary embeddings
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On maximal ladders
Add(ω, ω_ω) forces maximal n-ladders to have size ℵ_{n-1} for every n, answering Ditor's question positively, while also establishing consistency results for n=3 under d=ℵ_1, clubsuit, and diamond.