Analytic countably splitting families
Spinas, Otmar
J. Symbolic Logic, Tome 69 (2004) no. 1, p. 101-117 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
A family A⊆𝒫(ω) is called countably splitting if for every countable F⊆[ω]ω, some element of A splits every member of F. We define a notion of a splitting tree, by means of which we prove that every analytic countably splitting family contains a closed countably splitting family. An application of this notion solves a problem of Blass. On the other hand we show that there exists an Fσ splitting family that does not contain a closed splitting family.
Publié le : 2004-03-14
Classification:  
@article{1080938830,
     author = {Spinas, Otmar},
     title = {Analytic countably splitting families},
     journal = {J. Symbolic Logic},
     volume = {69},
     number = {1},
     year = {2004},
     pages = { 101-117},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1080938830}
}

Spinas, Otmar. Analytic countably splitting families. J. Symbolic Logic, Tome 69 (2004) no. 1, pp.  101-117. http://gdmltest.u-ga.fr/item/1080938830/