Analytic countably splitting families

  title={Analytic countably splitting families},
  author={Otmar Spinas},
  journal={Journal of Symbolic Logic},
  pages={101 - 117}
  • O. Spinas
  • Published 1 March 2004
  • Mathematics
  • Journal of Symbolic Logic
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. 
Perfect set theorems
We study splitting, innitely often equal (ioe) and rening families from the descriptive point of view, i.e. we try to characterize closed, Borel or analytic such families by proving perfect set
Hypergraphs and proper forcing
It turns out that many of the quotient posets are proper and for this broad class of posets, most fusion arguments and iteration preservation arguments can be replaced with simple combinatorial considerations concerning the hypergraphs.
On splitting trees
We investigate two variants of splitting tree forcing, their ideals and regularity properties. We prove connections with other well-known notions, such as Lebesgue measurablility, Baire- and
Ramsey type properties of ideals
Borel Tukey morphisms and combinatorial cardinal invariants of the continuum
We discuss the Borel Tukey ordering on cardinal invariants of the continuum. We observe that this ordering makes sense for a larger class of cardinals than has previously been considered. We then
Some combinatorial properties of splitting trees
We show that splitting forcing does not have the weak Sacks property below any condition, answering a question of Laguzzi, Mildenberger and Stuber-Rousselle. We also show how some partition results
The σ-ideal generated by H-sets ∗
It is consistent with the axioms of set theory that the circle T can be covered by א1 many closed sets of uniqueness while a much larger number of H-sets is necessary to cover it. In the proof of
Canonical Ramsey Theory on Polish Spaces
Preface 1. Introduction 2. Background facts 3. Analytic equivalence relations and models of set theory 4. Classes of equivalence relations 5. Games and the Silver property 6. The game ideals 7.
Combinatorics of filters and ideals
We study the combinatorial aspects of filters and ideals on countable sets, concentrating on Borel ideals and their interaction with non-definable ones. The basic tools for this study are cardinal
Tree forcing and definable maximal independent sets in hypergraphs
We show that after forcing with a countable support iteration or a finite product of Sacks or splitting forcing over $L$, every analytic hypergraph on a Polish space admits a $\mathbf{\Delta}^1_2$


On a notion of smallness for subsets of the Baire space
Let us call a set A ⊆ ω^ω of functions from ω into ω σ-bounded if there is a countable sequence of functions (α_n: n Є ω)⊆ ω^ω such that every member of A is pointwise dominated by an element of that
Regularity Properties for Dominating Projective Sets
Dominating Projective Sets in the Baire Space
Reductions Between Cardinal Characteristics of the Continuum
We discuss two general aspects of the theory of cardinal characteristics of the continuum, especially of proofs of inequalities between such characteristics. The first aspect is to express the
Non-constructive Galois-Tukey connections
Abstract There are inequalities between cardinal characteristics of the continuum that are true in any model of ZFC, but without a Borel morphism proving the inequality. We answer some questions from
No Borel Connections for the Unsplitting Relations
We prove that there is no Borel connection for non-trivial pairs of unsplitting relations. This was conjectured in (3). Mathematics Subject Classification: 03E15, 03E17, 03E35.
Set theory - an introduction to independence proofs
  • K. Kunen
  • Mathematics
    Studies in logic and the foundations of mathematics
  • 1983
The Foundations of Set Theory and Infinitary Combinatorics are presented, followed by a discussion of easy Consistency Proofs and Defining Definability.
  • 1, Academic Press
  • 1980