Combinatorial properties of classical forcing notions (Q1892933)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Combinatorial properties of classical forcing notions
scientific article

    Statements

    Combinatorial properties of classical forcing notions (English)
    0 references
    0 references
    18 December 1995
    0 references
    This paper investigates the effect of adding various generic reals on cardinal invariants less than the continuum. It is shown that adding an eventually different real or a localization real adjoins a Luzin set of size continuum and a mad family of size \(\omega_1\). Adding Mathias or Laver reals adds a dominating family in \(\omega^\omega\) of size \(\omega_1\). By contrast superperfect forcing preserves MA\((\sigma\)- centered). Eventually different forcing is the natural ccc forcing for adding an element of \(\omega^\omega\) which is eventually different from each ground model element of \(\omega^\omega\). Conditions have the form \((s,F)\) where \(s \in \omega^{< \omega}\) is a finite sequence and \(F\) is a finite subset of \(\omega^\omega\). \((s,F) \leq (t,H)\) iff \(s \supseteq t\), \(F \supseteq H\), and for every \(n\) with \(|t |< n < |s |\) and \(h \in H\) we have \(s(n) \neq h(n)\). Localization forcing is the natural ccc forcing for adding a sequence \(\langle H_n : n \in \omega )\) such that \(H_n \in [\omega]^n\) and for every ground model \(g \in \omega^\omega\) we have \(g(n) \in H_n\) for all but finitely many \(n < \omega\). So conditions would be of the form \((s,F)\) where domain of \(s = (H_n : n < N)\) where \(N \in \omega\) and \(|H_n |\in [\omega]^n\) and \(F \in [\omega^\omega]^N\). \((s,F) \leq (t,H)\) iff \(s \supseteq t\), \(F \supseteq H\), and for every \(n\) with \(N_t < n < N_s\) and \(h \in H\) we have \(h(n) \in H^s_n\).
    0 references
    0 references
    generic reals
    0 references
    Luzin set
    0 references
    mad family
    0 references
    dominating family
    0 references
    ccc forcing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references