Switch to: Citations

Add references

You must login to add references.
  1. [Foreign Language Ignored].[Foreign Language Ignored] [Foreign Language Ignored] - 1973 - Mathematical Logic Quarterly 19 (30):453-468.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Manuel Blum. A Machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336. [REVIEW]Manuel Blum - 1970 - Journal of Symbolic Logic 34 (4):657-658.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • (1 other version)On the interpretation of intuitionistic number theory.S. C. Kleene - 1945 - Journal of Symbolic Logic 10 (4):109-124.
    Download  
     
    Export citation  
     
    Bookmark   80 citations  
  • On the Computational Complexity of Algorithms.J. Hartmanis & R. E. Stearns - 1967 - Journal of Symbolic Logic 32 (1):120-121.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Ensembles Récursivement Mesurable et Ensembles Récursivement Ouverts ou Fermés.Georg Kreisel & Daniel Lacombe - 1966 - Journal of Symbolic Logic 31 (1):133-133.
    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-6d5f778f9-c5swx uwo