Switch to: Citations

Add references

You must login to add references.
  1. Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   602 citations  
  • (1 other version)On deterministic normal systems.Paul Axt & W. E. Singletary - 1969 - Mathematical Logic Quarterly 15 (4‐5):49-62.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)On deterministic normal systems.Paul Axt & W. E. Singletary - 1969 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 15 (4-5):49-62.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (2 other versions)Machine Configuration and Word Problems of Given Degree of Unsolvability.J. C. Shepherdson - 1965 - Mathematical Logic Quarterly 11 (2):149-175.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (2 other versions)Machine Configuration and Word Problems of Given Degree of Unsolvability.J. C. Shepherdson - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (2):149-175.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Quantificational variants on the halting problem for turing machines.Patrick C. Fischer - 1969 - Mathematical Logic Quarterly 15 (13-15):211-218.
    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-6f97f49787-zrclg uwo