Switch to: Citations

Add references

You must login to add references.
  1. On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
    Download  
     
    Export citation  
     
    Bookmark   720 citations  
  • (1 other version)Nicht konstruktiv beweisbare sätze der analysis.Ernst Specker - 1949 - Journal of Symbolic Logic 14 (3):145-158.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • Berechenbare Reelle Funktionen.Jürgen Hauck - 1973 - Mathematical Logic Quarterly 19 (8-10):121-140.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A topological analog to the rice-Shapiro index theorem.Louise Hay & Douglas Miller - 1982 - Journal of Symbolic Logic 47 (4):824-832.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On Computable Sequences.A. Mostowski - 1960 - Journal of Symbolic Logic 25 (4):367-367.
    Download  
     
    Export citation  
     
    Bookmark   5 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-zlfb6 uwo