Switch to: Citations

Add references

You must login to add references.
  1. (2 other versions)Σ1 2 and Π1 1 Mad Families.Asger Törnquist - 2013 - Journal of Symbolic Logic 78 (4):1181-1182.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
    Download  
     
    Export citation  
     
    Bookmark   94 citations  
  • Projective mad families.Sy-David Friedman & Lyubomyr Zdomskyy - 2010 - Annals of Pure and Applied Logic 161 (12):1581-1587.
    Using almost disjoint coding we prove the consistency of the existence of a definable ω-mad family of infinite subsets of ω together with.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Cardinal characteristics, projective wellorders and large continuum.Vera Fischer, Sy David Friedman & Lyubomyr Zdomskyy - 2013 - Annals of Pure and Applied Logic 164 (7-8):763-770.
    We extend the work of Fischer et al. [6] by presenting a method for controlling cardinal characteristics in the presence of a projective wellorder and 2ℵ0>ℵ2. This also answers a question of Harrington [9] by showing that the existence of a Δ31 wellorder of the reals is consistent with Martinʼs axiom and 2ℵ0=ℵ3.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Projective wellorders and mad families with large continuum.Vera Fischer, Sy David Friedman & Lyubomyr Zdomskyy - 2011 - Annals of Pure and Applied Logic 162 (11):853-862.
    We show that is consistent with the existence of a -definable wellorder of the reals and a -definable ω-mad subfamily of [ω]ω.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Set Theory: An Introduction to Independence Proofs.Kenneth Kunen - 1980 - North-Holland.
    Download  
     
    Export citation  
     
    Bookmark   169 citations  
  • Countable Fréchet Boolean groups: An independence result.Jörg Brendle & Michael Hrušák - 2009 - Journal of Symbolic Logic 74 (3):1061-1068.
    It is relatively consistent with ZFC that every countable $FU_{fin} $ space of weight N₁ is metrizable. This provides a partial answer to a question of G. Gruenhage and P. Szeptycki [GS1].
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Long projective wellorderings.Leo Harrington - 1977 - Annals of Mathematical Logic 12 (1):1.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Infinite combinatorics and definability.Arnold W. Miller - 1989 - Annals of Pure and Applied Logic 41 (2):179-203.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Analytic and coanalytic families of almost disjoint functions.Bart Kastermans, Juris Steprāns & Yi Zhang - 2008 - Journal of Symbolic Logic 73 (4):1158-1172.
    If F ⊆ NN is an analytic family of pairwise eventually different functions then the following strong maximality condition fails: For any countable H ⊆ NN. no member of which is covered by finitely many functions from F, there is f ∈ F such that for all h ∈ H there are infinitely many integers k such that f(k) = h(k). However if V = L then there exists a coanalytic family of pairwise eventually different functions satisfying this strong maximality (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (2 other versions)Σ12 and Π11 Mad Families.Asger Törnquist - 2009 - Journal of Symbolic Logic 78 (4):1181-1182.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (2 other versions)$\Sigma^12$ and $\Pi^11$ mad families.Asger Törnquist - 2013 - Journal of Symbolic Logic 78 (4):1181-1182.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Cardinal characteristics and projective wellorders.Vera Fischer & Sy David Friedman - 2010 - Annals of Pure and Applied Logic 161 (7):916-922.
    Using countable support iterations of S-proper posets, we show that the existence of a definable wellorder of the reals is consistent with each of the following: , and.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Mad Families Constructed from Perfect Almost Disjoint Families.Jörg Brendle & Yurii Khomskii - 2013 - Journal of Symbolic Logic 78 (4):1164-1180.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Adjoining dominating functions.James E. Baumgartner & Peter Dordal - 1985 - Journal of Symbolic Logic 50 (1):94-101.
    If dominating functions in ω ω are adjoined repeatedly over a model of GCH via a finite-support c.c.c. iteration, then in the resulting generic extension there are no long towers, every well-ordered unbounded family of increasing functions is a scale, and the splitting number s (and hence the distributivity number h) remains at ω 1.
    Download  
     
    Export citation  
     
    Bookmark   21 citations