Switch to: Citations

Add references

You must login to add references.
  1. Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
    Download  
     
    Export citation  
     
    Bookmark   90 citations  
  • Primes and their residue rings in models of open induction.Angus Macintyre & David Marker - 1989 - Annals of Pure and Applied Logic 43 (1):57-77.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Some Classes of Recursive Functions.Andrzej Grzegorczyk - 1955 - Journal of Symbolic Logic 20 (1):71-72.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
    Download  
     
    Export citation  
     
    Bookmark   96 citations  
  • Provability of the pigeonhole principle and the existence of infinitely many primes.J. B. Paris, A. J. Wilkie & A. R. Woods - 1988 - Journal of Symbolic Logic 53 (4):1235-1244.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Classes of Predictably Computable Functions.Robert W. Ritchie - 1963 - Journal of Symbolic Logic 28 (3):252-253.
    Download  
     
    Export citation  
     
    Bookmark   12 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-l46rg uwo