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  
  • (1 other version)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  
  • Boolean Algebras.Roman Sikorski - 1966 - Journal of Symbolic Logic 31 (2):251-253.
    Download  
     
    Export citation  
     
    Bookmark   87 citations  
  • (1 other version)Theorie Der Numerierungen III.Ju L. Erš - 1976 - Mathematical Logic Quarterly 23 (19‐24):289-371.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • (1 other version)Theorie Der Numerierungen III.Ju L. Erš - 1977 - Mathematical Logic Quarterly 23 (19-24):289-371.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Recursively enumerable Boolean algebras.J. B. Remmel - 1978 - Annals of Mathematical Logic 15 (1):75.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Combinatorial Functors.J. N. Crossley & Anil Nerode - 1977 - Journal of Symbolic Logic 42 (4):586-587.
    Download  
     
    Export citation  
     
    Bookmark   15 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-6f9648bdd6-4ctxt uwo