Switch to: Citations

Add references

You must login to add references.
  1. Turing determinacy and the continuum hypothesis.Ramez L. Sami - 1989 - Archive for Mathematical Logic 28 (3):149-154.
    From the hypothesis that all Turing closed games are determined we prove: (1) the Continuum Hypothesis and (2) every subset of ℵ1 is constructible from a real.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Turing cones and set theory of the reals.Benedikt Löwe - 2001 - Archive for Mathematical Logic 40 (8):651-664.
    We investigate Turing cones as sets of reals, and look at the relationship between Turing cones, measures, Baire category and special sets of reals, using these methods to show that Martin's proof of Turing Determinacy (every determined Turing closed set contains a Turing cone or is disjoint from one) does not work when you replace “determined” with “Blackwell determined”. This answers a question of Tony Martin.
    Download  
     
    Export citation  
     
    Bookmark   2 citations