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  
  • (2 other versions)Computability & Unsolvability.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
    Download  
     
    Export citation  
     
    Bookmark   106 citations  
  • Boolean Algebras.Roman Sikorski - 1966 - Journal of Symbolic Logic 31 (2):251-253.
    Download  
     
    Export citation  
     
    Bookmark   87 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-kd5kv uwo