123,986 research outputs found
Forcing with Adequate Sets of Models as Side Conditions
We present a general framework for forcing on with finite
conditions using countable models as side conditions. This framework is based
on a method of comparing countable models as being membership related up to a
large initial segment. We give several examples of this type of forcing,
including adding a function on , adding a nonreflecting stationary
subset of , and adding an -Kurepa
tree
Coherent Adequate Sets and Forcing Square
We introduce the idea of a coherent adequate set of models, which can be used
as side conditions in forcing. As an application we define a forcing poset
which adds a square sequence on using finite conditions
Quotients of Strongly Proper Forcings and Guessing Models
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 -approximation
property. We prove that the existence of stationarily many -guessing
models in , for sufficiently large cardinals ,
is consistent with the continuum being arbitrarily large, solving a problem of
Viale and Weiss
- …