March 2004 Analytic countably splitting families
Otmar Spinas
J. Symbolic Logic 69(1): 101-117 (March 2004). DOI: 10.2178/jsl/1080938830

Abstract

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.

Citation

Download Citation

Otmar Spinas. "Analytic countably splitting families." J. Symbolic Logic 69 (1) 101 - 117, March 2004. https://doi.org/10.2178/jsl/1080938830

Information

Published: March 2004
First available in Project Euclid: 2 April 2004

zbMATH: 1067.03054
MathSciNet: MR2039350
Digital Object Identifier: 10.2178/jsl/1080938830

Rights: Copyright © 2004 Association for Symbolic Logic

JOURNAL ARTICLE
17 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.69 • No. 1 • March 2004
Back to Top