degrees of computably enumerable sets are not dense - PhilArchive" />
Switch to: Citations

Add references

You must login to add references.
  1. The weak truth table degrees of recursively enumerable sets.R. E. Ladner - 1975 - Annals of Mathematical Logic 8 (4):429.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • There Is No SW-Complete C.E. Real.Liang Yu & Decheng Ding - 2004 - Journal of Symbolic Logic 69 (4):1163 - 1170.
    We prove that there is no sw-complete c.e. real, negatively answering a question in [6].
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Computability theory and differential geometry.Robert I. Soare - 2004 - Bulletin of Symbolic Logic 10 (4):457-486.
    Let M be a smooth, compact manifold of dimension n ≥ 5 and sectional curvature | K | ≤ 1. Let Met (M) = Riem(M)/Diff(M) be the space of Riemannian metrics on M modulo isometries. Nabutovsky and Weinberger studied the connected components of sublevel sets (and local minima) for certain functions on Met (M) such as the diameter. They showed that for every Turing machine T e , e ∈ ω, there is a sequence (uniformly effective in e) of homology (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Strong reducibility on hypersimple sets.T. G. McLaughlin - 1965 - Notre Dame Journal of Formal Logic 6 (3):229-234.
    Download  
     
    Export citation  
     
    Bookmark   2 citations