Sh:630

• Shelah, S. (2004). Properness without elementaricity. J. Appl. Anal., 10(2), 169–289. arXiv: math/9712283 DOI: 10.1515/JAA.2004.169 MR: 2115943
• Abstract:
  We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some ({\mathcal H}(\chi),\in). This leads to forcing notions which are “reasonably" definable. We present two specific properties materializing this intuition: nep (non-elementary properness) and snep (Souslin non-elementary properness). For this we consider candidates (countable models to which the definition applies), and the older Souslin proper. 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 define c.c.c. ideals, then they preserve the positiveness of any old positive set. We also prove that (among such forcing notions) the only one commuting with Cohen is Cohen itself.
• Version 2003-05-03_11 (105p) published version (121p)

@article{Sh:630,
 author = {Shelah, Saharon},
 title = {{Properness without elementaricity}},
 journal = {J. Appl. Anal.},
 fjournal = {Journal of Applied Analysis},
 volume = {10},
 number = {2},
 year = {2004},
 pages = {169--289},
 issn = {1425-6908},
 mrnumber = {2115943},
 mrclass = {03E40 (03E05 03E47)},
 doi = {10.1515/JAA.2004.169},
 note = {\href{https://arxiv.org/abs/math/9712283}{arXiv: math/9712283}},
 arxiv_number = {math/9712283}
}