NAMBA FORCING, WEAK APPROXIMATION, AND GUESSING
AbstractWe prove a variation of Easton’s lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle IGMP, GMP together with 2ω ≤ ω2 is consistent with the existence of an ω1-distributive nowhere c.c.c. forcing poset of size ω1. We introduce the idea of a weakly guessing model, and prove that many of the strong consequences of the principle GMP follow from the existence of stationarily many weakly guessing models. Using Namba forcing, we construct a model in which there are stationarily many indestructibly weakly guessing models which have a bounded countable subset not covered by any countable set in the model.
Keyword(s):
Keyword(s):
2001 ◽
pp. 357-404
◽
2016 ◽
Vol 152
(7)
◽
pp. 1435-1475
◽
Modifying AMG Coarse Spaces with Weak Approximation Property to Exhibit Approximation in Energy Norm
2019 ◽
Vol 40
(3)
◽
pp. 1131-1152
Keyword(s):