Switch to: Citations

Add references

You must login to add references.
  1. The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal.W. Hugh Woodin - 2002 - Bulletin of Symbolic Logic 8 (1):91-93.
    Download  
     
    Export citation  
     
    Bookmark   58 citations  
  • (2 other versions)Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.
    Download  
     
    Export citation  
     
    Bookmark   327 citations  
  • Infinitary Combinatorics and the Axiom of Determinateness.Eugene M. Kleinberg - 1982 - Journal of Symbolic Logic 47 (3):698-701.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Ordinal definability and combinatorics of equivalence relations.William Chan - 2019 - Journal of Mathematical Logic 19 (2):1950009.
    Assume [Formula: see text]. Let [Formula: see text] be a [Formula: see text] equivalence relation coded in [Formula: see text]. [Formula: see text] has an ordinal definable equivalence class without any ordinal definable elements if and only if [Formula: see text] is unpinned. [Formula: see text] proves [Formula: see text]-class section uniformization when [Formula: see text] is a [Formula: see text] equivalence relation on [Formula: see text] which is pinned in every transitive model of [Formula: see text] containing the real (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The cardinals below | [ ω 1 ] ω 1 |.W. Hugh Woodin - 2006 - Annals of Pure and Applied Logic 140 (1-3):161-232.
    The results of this paper concern the effective cardinal structure of the subsets of [ω1]<ω1, the set of all countable subsets of ω1. The main results include dichotomy theorems and theorems which show that the effective cardinal structure is complicated.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)The cardinals below |[ω1]<ω1|.W. Hugh Woodin - 2006 - Annals of Pure and Applied Logic 140 (1-3):161-232.
    The results of this paper concern the effective cardinal structure of the subsets of [ω1]<ω1, the set of all countable subsets of ω1. The main results include dichotomy theorems and theorems which show that the effective cardinal structure is complicated.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Counting the number of equivalence classes of Borel and coanalytic equivalence relations.Jack H. Silver - 1980 - Annals of Mathematical Logic 18 (1):1.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Determinacy and Jónsson cardinals in L.S. Jackson, R. Ketchersid, F. Schlutzenberg & W. H. Woodin - 2014 - Journal of Symbolic Logic 79 (4):1184-1198.
    Assume ZF + AD +V=L and letκ< Θ be an uncountable cardinal. We show thatκis Jónsson, and that if cof = ω thenκis Rowbottom. We also establish some other partition properties.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A dichotomy for the definable universe.Greg Hjorth - 1995 - Journal of Symbolic Logic 60 (4):1199-1207.
    In the presence of large cardinals, or sufficient determinacy, every equivalence relation in L(R) either admits a wellordered separating family or continuously reduces E 0.
    Download  
     
    Export citation  
     
    Bookmark   6 citations