Antichains of perfect and splitting trees

Archive for Mathematical Logic 59 (3-4):367-388 (2020)
  Copy   BIBTEX

Abstract

We investigate uncountable maximal antichains of perfect trees and of splitting trees. We show that in the case of perfect trees they must have size of at least the dominating number, whereas for splitting trees they are of size at least \\), i.e. the covering coefficient of the meager ideal. Finally, we show that uncountable maximal antichains of superperfect trees are at least of size the bounding number; moreover we show that this is best possible.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Uncountable trees and Cohen -reals.Giorgio Laguzzi - 2019 - Journal of Symbolic Logic 84 (3):877-894.
Decisive creatures and large continuum.Jakob Kellner & Saharon Shelah - 2009 - Journal of Symbolic Logic 74 (1):73-104.
Trees and Π 1 1 -Subsets of ω1 ω 1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052 - 1070.
Creature forcing and large continuum: the joy of halving.Jakob Kellner & Saharon Shelah - 2012 - Archive for Mathematical Logic 51 (1-2):49-70.
Maximal trees.Jörg Brendle - 2018 - Archive for Mathematical Logic 57 (3-4):421-428.
Many simple cardinal invariants.Martin Goldstern & Saharon Shelah - 1993 - Archive for Mathematical Logic 32 (3):203-221.
VC-density for trees.Anton Bobkov - 2019 - Archive for Mathematical Logic 58 (5-6):587-603.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
Trees and $Pi^11$-Subsets of $^{omega_1}omega1$.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
Bounding, splitting, and almost disjointness.Jörg Brendle & Dilip Raghavan - 2014 - Annals of Pure and Applied Logic 165 (2):631-651.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
Analytic countably splitting families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.
Chains and antichains in interval algebras.M. Bekkali - 1994 - Journal of Symbolic Logic 59 (3):860-867.

Analytics

Added to PP
2019-09-20

Downloads
10 (#1,025,836)

6 months
3 (#445,838)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On splitting trees.Giorgio Laguzzi, Heike Mildenberger & Brendan Stuber-Rousselle - 2023 - Mathematical Logic Quarterly 69 (1):15-30.
Different cofinalities of tree ideals.Saharon Shelah & Otmar Spinas - 2023 - Annals of Pure and Applied Logic 174 (8):103290.

Add more citations

References found in this work

[Omnibus Review].Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.
Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
Generic trees.Otmar Spinas - 1995 - Journal of Symbolic Logic 60 (3):705-726.

View all 9 references / Add more references