A model in which the base-matrix tree cannot have cofinal branches (Q3778013)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4037851
Language Label Description Also known as
default for all languages
No label defined
    English
    A model in which the base-matrix tree cannot have cofinal branches
    scientific article; zbMATH DE number 4037851

      Statements

      A model in which the base-matrix tree cannot have cofinal branches (English)
      0 references
      0 references
      1987
      0 references
      iterated forcing
      0 references
      base-matrix tree
      0 references
      distributivity cardinal
      0 references
      tower
      0 references
      model of ZFC
      0 references
      Mathias forcing
      0 references
      Let \([\omega]^{\omega}\) be the set of all infinite subsets of \(\omega\). \(x\subseteq_*y\) means that x-y is finite. The distributivity cardinal \({\mathfrak h}\) is the least \(\kappa\) such that forcing with \(<[\omega]^{\omega},\subseteq_*>\) adds a new function \(f: \kappa\to V\). An \(\alpha\)-tower in \([\omega]^{\omega}\) is a descending \(\alpha\)- sequence \(<x_{\beta}: \beta <\alpha >\) such that there is no \(x\in [\omega]^{\omega}\) almost contained in all the \(x_{\beta}.\) The author constructs a model of ZFC in which the distributivity cardinal \({\mathfrak h}\) is \(2^{\aleph_ 0}=\aleph_ 2\) and in which there are no \(\aleph_ 2\)-towers in \([\omega]^{\omega}\). This is done by iterating Mathias forcing. Mathias forcing is factorized into a countably closed and a \(\sigma\)-centered part. Then the author uses a mixture of finite and countable supports.
      0 references

      Identifiers