Switch to: Citations

Add references

You must login to add references.
  1. A recursively enumerable degree which will not split over all lesser ones.Alistair H. Lachlan - 1976 - Annals of Mathematical Logic 9 (4):307.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Trial and error predicates and the solution to a problem of Mostowski.Hilary Putnam - 1965 - Journal of Symbolic Logic 30 (1):49-57.
    Download  
     
    Export citation  
     
    Bookmark   98 citations  
  • Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion.C. G. Jockusch, M. Lerman, R. I. Soare & R. M. Solovay - 1989 - Journal of Symbolic Logic 54 (4):1288-1323.
    Download  
     
    Export citation  
     
    Bookmark   20 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-fd59bd6bd-cr8vk uwo