On iterating semiproper preorders

DOI10.2178/jsl/1190150293zbMath1050.03034OpenAlexW2017493871MaRDI QIDQ4451727

Tadatoshi Miyamoto

Publication date: 1 March 2004

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1190150293

zbMATH Keywords

Souslin treerevised countable support iterationsemiproper forcing

Mathematics Subject Classification ID

Other aspects of forcing and Boolean-valued models (03E40)

Related Items (7)

\(\text{PFA}(S)[S\) for the masses] ⋮ Incompatible bounded category forcing axioms ⋮ THE DIAGONAL STRONG REFLECTION PRINCIPLE AND ITS FRAGMENTS ⋮ The special tree number ⋮ Set theory. Abstracts from the workshop held January 9--15, 2022 ⋮ Katetov’s problem ⋮ NS SATURATED AND -DEFINABLE

Cites Work

• Simplified RCS iterations
• Iterated forcing and normal ideals on \(\omega _ 1\)
• Unnamed Item

This page was built for publication: On iterating semiproper preorders