Switch to: Citations

Add references

You must login to add references.
  1. The recursively enumerable degrees have infinitely many one-types.Klaus Ambos-Spies & Robert I. Soare - 1989 - Annals of Pure and Applied Logic 44 (1-2):1-23.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets.Robert I. Soare - 1990 - Journal of Symbolic Logic 55 (1):356-357.
    Download  
     
    Export citation  
     
    Bookmark   41 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  
  • (2 other versions)Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers.Peter G. Hinman - 1990 - Journal of Symbolic Logic 55 (3):1307-1308.
    Download  
     
    Export citation  
     
    Bookmark   19 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-6f97f49787-df84k uwo