Properness without elementaricity

S. Shelah*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

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(χ), ∈). 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) 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.

Original languageEnglish
Pages (from-to)169-189
Number of pages21
JournalJournal of Applied Analysis
Volume10
Issue number2
DOIs
StatePublished - Dec 2004

Keywords

  • Cohen forcing
  • Commuting forcing
  • Forcing
  • Fubini theorem
  • Iterated forcing
  • Nep
  • Preservation for iterated forcing
  • Set theory
  • Snep

Fingerprint

Dive into the research topics of 'Properness without elementaricity'. Together they form a unique fingerprint.

Cite this