Advertisement

Archive for Mathematical Logic

, Volume 57, Issue 3–4, pp 421–428 | Cite as

Maximal trees

  • Jörg Brendle
Article
  • 45 Downloads

Abstract

We show that, consistently, there can be maximal subtrees of \(\mathcal{P}(\omega )\) and \(\mathcal{P}(\omega ) / {\mathrm {fin}}\) of arbitrary regular uncountable size below the size of the continuum \({\mathfrak c}\). We also show that there are no maximal subtrees of \(\mathcal{P}(\omega ) / {\mathrm {fin}}\) with countable levels. Our results answer several questions of Campero-Arena et al. (Fund Math 234:73–89, 2016).

Keywords

Tree Maximal tree Tree number ccc forcing Iterated forcing Mathias forcing 

Mathematics Subject Classification

Primary 03E35 Secondary 03E17 03E05 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Blass, A.: Combinatorial cardinal characteristics of the continuum. In: Foreman, M., Kanamori, A. (eds.) Handbook of Set Theory, pp. 395–489. Springer, Dordrecht (2010)CrossRefGoogle Scholar
  2. 2.
    Campero-Arena, G., Cancino, J., Hrušák, M., Miranda-Perea, F.: Incomparable families and maximal trees. Fund. Math. 234, 73–89 (2016)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Goldstern, M.: Tools for your forcing construction. In: Judah, H., (ed.) Set Theory of the Reals Israel Mathematical Conference Proceedings, Vol. 6, pp. 305-0360 (1993)Google Scholar
  4. 4.
    Monk, D.: Cardinal Invariants on Boolean Algebras, 2nd edn. Birkhäuser, Boston (2014)CrossRefzbMATHGoogle Scholar
  5. 5.
    Moore, J., Hrušák, M., Džamonja, M.: Parametrized \(\diamondsuit \) principles. Trans. Am. Math. Soc. 356, 2281–2306 (2004)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  1. 1.Graduate School of System InformaticsKobe UniversityKobeJapan

Personalised recommendations