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  
  • (2 other versions)Degrees of Unsolvability.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (3):452-453.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Maximal alpha-r.e. sets and their complements.Anne Leggett - 1974 - Annals of Mathematical Logic 6 (3/4):293.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Hyperhypersimple α-r.e. sets.C. T. Chong & M. Lerman - 1976 - Annals of Mathematical Logic 9 (1-2):1-48.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (1 other version)Hyperhypersimple alpha-r.e. sets.C. T. Chong - 1976 - Annals of Mathematical Logic 9 (1/2):1.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-7b7f6c6655-p5z45 uwo