Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.
    Download  
     
    Export citation  
     
    Bookmark   88 citations  
  • Totally ω-computably enumerable degrees and bounding critical triples.Rod Downey, Noam Greenberg & Rebecca Weber - 2007 - Journal of Mathematical Logic 7 (2):145-171.
    We characterize the class of c.e. degrees that bound a critical triple as those degrees that compute a function that has no ω-c.e. approximation.
    Download  
     
    Export citation  
     
    Bookmark   8 citations