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   596 citations  
  • (1 other version)On the Complexity of Analytic Sets.Karel Hrbacek - 1978 - Mathematical Logic Quarterly 24 (25‐30):419-425.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)On the Complexity of Analytic Sets.Karel Hrbacek - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (25-30):419-425.
    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-76d885d765-26dnj uwo