On iterating semiproper preorders

DOI10.2178/JSL/1190150293MaRDI QIDQ4451727zbMATH OpenOpenAlexFDO

Authors 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

revised countable support iterationsemiproper forcingSouslin tree

Mathematics Subject Classification ID

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

Recommendations

• Many countable support iterations of proper forcings preserve Souslin trees
• scientific article; zbMATH DE number 2063226
• More on proper forcing
• Souslin forcing
• scientific article; zbMATH DE number 797413

Cites work

• scientific article; zbMATH DE number 3805451 (Why is no real title available?)
• Iterated forcing and normal ideals on \(\omega _ 1\)
• Simplified RCS iterations

Cited in

(18)

• \(\text{PFA}(S)[S]\) for the masses
• Set theory. Abstracts from the workshop held January 9--15, 2022
• Katětov's problem
• Preservation of Suslin trees and side conditions
• Souslin forcing
• Many countable support iterations of proper forcings preserve Souslin trees
• scientific article; zbMATH DE number 474586 (Why is no real title available?)
• scientific article; zbMATH DE number 2063226 (Why is no real title available?)
• NS SATURATED AND -DEFINABLE
• SPFA by finite conditions
• Incompatible bounded category forcing axioms
• 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 from iterability
• THE DIAGONAL STRONG REFLECTION PRINCIPLE AND ITS FRAGMENTS
• The special tree number
• Increasing the second uniform indiscernible by strongly SSP forcing
• Simplified RCS iterations
• Iteration theorems for subversions of forcing classes
• Forcing axioms and the definability of the nonstationary ideal on the first uncountable

This page was built for publication: On iterating semiproper preorders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451727)