QUOTIENTS OF STRONGLY PROPER FORCINGS AND GUESSING MODELS

DOI10.1017/jsl.2015.46zbMath1383.03052arXiv1406.3306OpenAlexW2962728770MaRDI QIDQ2805037

John Krueger, Sean D. Cox

Publication date: 9 May 2016

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

Full work available at URL: https://arxiv.org/abs/1406.3306

zbMATH Keywords

approximation propertyguessing modeladequate set forcingstrongly proper

Mathematics Subject Classification ID

Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (9)

The approachability ideal without a maximal set ⋮ THE TREE PROPERTY AT AND ⋮ Club stationary reflection and the special Aronszajn tree property ⋮ Indestructibility of some compactness principles over models of \(\mathsf{PFA} \) ⋮ SPECIALISING TREES WITH SMALL APPROXIMATIONS I ⋮ Guessing models and the approachability ideal ⋮ NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING ⋮ Mitchell's theorem revisited ⋮ Club isomorphisms on higher Aronszajn trees

Cites Work

• Unnamed Item
• The combinatorial essence of supercompactness
• On the consistency strength of the proper forcing axiom
• On the Hamkins approximation property
• Adding a club with finite conditions. II
• Forcing with sequences of models of two types
• Coherent adequate sets and forcing square

This page was built for publication: QUOTIENTS OF STRONGLY PROPER FORCINGS AND GUESSING MODELS