Analytic countably splitting families

Journal of Symbolic Logic 69 (1):101-117 (2004)
  Copy   BIBTEX

Abstract

A family A ⊆ ℘(ω) is called countably splitting if for every countable $F \subseteq [\omega]^{\omega}$ , 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_{\sigma}$ splitting family that does not contain a closed splitting family

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

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

Splitting families and the Noetherian type of β ω ∖ ω.David Milovich - 2008 - Journal of Symbolic Logic 73 (4):1289-1306.
Covering analytic sets by families of closed sets.Sławomir Solecki - 1994 - Journal of Symbolic Logic 59 (3):1022-1031.
Splitting number at uncountable cardinals.Jindřich Zapletal - 1997 - Journal of Symbolic Logic 62 (1):35-42.
Splittings and the finite model property.Marcus Kracht - 1993 - Journal of Symbolic Logic 58 (1):139-157.
Dissociable realization and kind splitting.Carl F. Craver - 2004 - Philosophy of Science 71 (5):960-971.
On countably closed complete Boolean algebras.Thomas Jech & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (4):1380-1386.
Cohen-stable families of subsets of integers.Miloš S. Kurilić - 2001 - Journal of Symbolic Logic 66 (1):257-270.

Analytics

Added to PP
2009-02-05

Downloads
219 (#92,531)

6 months
17 (#150,073)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Ramsey type properties of ideals.M. Hrušák, D. Meza-Alcántara, E. Thümmel & C. Uzcátegui - 2017 - Annals of Pure and Applied Logic 168 (11):2022-2049.
Antichains of perfect and splitting trees.Paul Hein & Otmar Spinas - 2020 - Archive for Mathematical Logic 59 (3-4):367-388.
Hypergraphs and proper forcing.Jindřich Zapletal - 2019 - Journal of Mathematical Logic 19 (2):1950007.
Separation problems and forcing.Jindřich Zapletal - 2013 - Journal of Mathematical Logic 13 (1):1350002.
On splitting trees.Giorgio Laguzzi, Heike Mildenberger & Brendan Stuber-Rousselle - 2023 - Mathematical Logic Quarterly 69 (1):15-30.

Add more citations

References found in this work

Regularity properties for dominating projective sets.Jörg Brendle, Greg Hjorth & Otmar Spinas - 1995 - Annals of Pure and Applied Logic 72 (3):291-307.
Dominating projective sets in the Baire space.Otmar Spinas - 1994 - Annals of Pure and Applied Logic 68 (3):327-342.
No Borel Connections for the Unsplitting Relations.Heike Mildenberger - 2002 - Mathematical Logic Quarterly 48 (4):517-521.

Add more references