On iterating semiproper preorders

DOI10.2178/JSL/1190150293zbMATH Open1050.03034OpenAlexW2017493871MaRDI QIDQ4451727FDOQ4451727

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

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

zbMATH Keywords

Souslin treerevised countable support iterationsemiproper forcing

Mathematics Subject Classification ID

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

Cites Work

• Iterated forcing and normal ideals on \(\omega _ 1\)
• Simplified RCS iterations
• Title not available (Why is that?)

Cited In (12)

• Simplified RCS iterations
• Incompatible bounded category forcing axioms
• Set theory. Abstracts from the workshop held January 9--15, 2022
• The special tree number
• Katětov's problem
• NS SATURATED AND -DEFINABLE
• Title not available (Why is that?)
• \(\text{PFA}(S)[S]\) for the masses
• Title not available (Why is that?)
• Souslin forcing
• 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 from iterability
• THE DIAGONAL STRONG REFLECTION PRINCIPLE AND ITS FRAGMENTS

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)