Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: iterowany forsing

Sortuj według:

Ogranicz wyniki do:

Properness without elementaricity

Shelah S.

Journal of Applied Analysis

2004

Vol. 10, nr 2

169-289

We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary sub-models of some (H(x),∈ ). This leads to forcing notions which are "reasonably" definable. We present two specific properties materializing this intuition: nep (non-elernentary properness) and snep (Souslin non-elementary properness) and also the older Souslin proper. For this we consider candidates (countable models to which the definition applies). A major theme here is "preservation by iteration", but we also show a dichotomy: if such forcing notions preserve the positiveness of the set of old reals for some naturally defined c.c.c. ideal, then they preserve the positiveness of any old positive set hence preservation by composition of two follows. Last but not least, we prove that (among such forcing notions) the only one commuting with Cohen is Cohen itself; in other words, any other such forcing notion make the set of old reals to a meager set. In the end we present some open problems in this area.