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   599 citations  
  • (2 other versions)Computability & Unsolvability.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
    Download  
     
    Export citation  
     
    Bookmark   106 citations  
  • Diversity of speed-ups and embeddability in computational complexity.Donald A. Alton - 1976 - Journal of Symbolic Logic 41 (1):199-214.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Computability of boolean algebras and their extensions.Donald A. Alton & E. W. Madison - 1973 - Annals of Mathematical Logic 6 (2):95-128.
    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-5d8df9484f-jj5d8 uwo