Switch to: Citations

Add references

You must login to add references.
  1. Minimal degrees and the jump operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   479 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   598 citations  
  • Popa superrigidity and countable Borel equivalence relations.Simon Thomas - 2009 - Annals of Pure and Applied Logic 158 (3):175-189.
    We present some applications of Popa’s Superrigidity Theorem to the theory of countable Borel equivalence relations. In particular, we show that the universal countable Borel equivalence relation E∞ is not essentially free.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Minimal Degrees and the Jump Operator.S. B. Cooper - 1975 - Journal of Symbolic Logic 40 (1):86-87.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Martin’s conjecture and strong ergodicity.Simon Thomas - 2009 - Archive for Mathematical Logic 48 (8):749-759.
    In this paper, we explore some of the consequences of Martin’s Conjecture on degree invariant Borel maps. These include the strongest conceivable ergodicity result for the Turing equivalence relation with respect to the filter on the degrees generated by the cones, as well as the statement that the complexity of a weakly universal countable Borel equivalence relation always concentrates on a null set.
    Download  
     
    Export citation  
     
    Bookmark   7 citations