Quotients of strongly proper forcings and guessing models

DOI10.1017/JSL.2015.46zbMATH Open1383.03052arXiv1406.3306OpenAlexW2962728770MaRDI QIDQ2805037FDOQ2805037

Authors: John Krueger, Sean Cox 

Publication date: 9 May 2016

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

Abstract: We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have simple universal strongly generic conditions on a stationary set of models by certain nice regular suborders satisfy the $omeg{a}_1$-approximation property. We prove that the existence of stationarily many $omeg{a}_1$-guessing models in $P_{omeg{a}_2}(H(heta))$, for sufficiently large cardinals $heta$, is consistent with the continuum being arbitrarily large, solving a problem of Viale and Weiss.

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

Recommendations

• Namba forcing, weak approximation, and guessing
• Guessing models imply the singular cardinal hypothesis
• Guessing and non-guessing of canonical functions
• Indestructible guessing models and the continuum
• PFA and guessing models

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)

Cites Work

• Title not available (Why is that?)
• The combinatorial essence of supercompactness
• On the consistency strength of the proper forcing axiom
• Forcing with sequences of models of two types
• On the Hamkins approximation property
• Adding a club with finite conditions. II
• Coherent adequate sets and forcing square

Cited In (12)

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

This page was built for publication: Quotients of strongly proper forcings and guessing models

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