RADO'S CONJECTURE IMPLIES THAT ALL STATIONARY SET PRESERVING FORCINGS ARE SEMIPROPER

DOI10.1142/S0219061313500013zbMath1300.03022OpenAlexW2171603704WikidataQ123197515 ScholiaQ123197515MaRDI QIDQ2853979

Philipp Doebler

Publication date: 17 October 2013

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

Full work available at URL: https://doi.org/10.1142/s0219061313500013

zbMATH Keywords

Chang's conjecturesemiproper forcingRado's conjecturesemistationary reflectionstationary set-preserving forcing

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Other set-theoretic hypotheses and axioms (03E65)

Related Items (5)

Strong Chang’s Conjecture, Semi-Stationary Reflection, the Strong Tree Property and two-cardinal square principles ⋮ A variant of Shelah's characterization of Strong Chang's Conjecture ⋮ Rado’s Conjecture and its Baire version ⋮ Strong downward Löwenheim-Skolem theorems for stationary logics. I ⋮ Chang's conjecture and semiproperness of nonreasonable posets

Cites Work

• \(\Pi_2\) consequences of \(\mathsf{BMM}+\mathsf{NS}_{\omega_1}\) is precipitous and the semiproperness of stationary set preserving forcings
• Martin's maximum, saturated ideals, and nonregular ultrafilters. I
• On a Conjecture of R. Rado
• Semistationary and stationary reflection
• PFA implies AD^L(ℝ)

This page was built for publication: RADO'S CONJECTURE IMPLIES THAT ALL STATIONARY SET PRESERVING FORCINGS ARE SEMIPROPER