Switch to: References

Add citations

You must login to add citations.
  1. Cardinal characteristics and countable Borel equivalence relations.Samuel Coskey & Scott Schneider - 2017 - Mathematical Logic Quarterly 63 (3-4):211-227.
    Boykin and Jackson recently introduced a property of countable Borel equivalence relations called Borel boundedness, which they showed is closely related to the union problem for hyperfinite equivalence relations. In this paper, we introduce a family of properties of countable Borel equivalence relations which correspond to combinatorial cardinal characteristics of the continuum in the same way that Borel boundedness corresponds to the bounding number. We analyze some of the basic behavior of these properties, showing, e.g., that the property corresponding to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Analytic countably splitting families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Pair-splitting, pair-reaping and cardinal invariants of F σ -ideals.Michael Hrušák, David Meza-Alcántara & Hiroaki Minami - 2010 - Journal of Symbolic Logic 75 (2):661-677.
    We investigate the pair-splitting number $\germ{s}_{pair}$ which is a variation of splitting number, pair-reaping number $\germ{r}_{pair}$ which is a variation of reaping number and cardinal invariants of ideals on ω. We also study cardinal invariants of F σ ideals and their upper bounds and lower bounds. As an application, we answer a question of S. Solecki by showing that the ideal of finitely chromatic graphs is not locally Katětov-minimal among ideals not satisfying Fatou's lemma.
    Download  
     
    Export citation  
     
    Bookmark   8 citations