Switch to: Citations

Add references

You must login to add references.
  1. Degrees of Unsolvability.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (3):452-453.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Relativized Halting Problems.Alan L. Selman - 1974 - Mathematical Logic Quarterly 20 (13-18):193-198.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   592 citations  
  • A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21-24):339-356.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21‐24):339-356.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • 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  
  • Spectra and halting problems.Louise Hay - 1975 - Mathematical Logic Quarterly 21 (1):167-176.
    Download  
     
    Export citation  
     
    Bookmark   3 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-5ff6c685cb-cc9fg uwo