Switch to: Citations

Add references

You must login to add references.
  1. The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 821 -- 865.
    Download  
     
    Export citation  
     
    Bookmark   102 citations  
  • The collected papers of Gerhard Gentzen.Gerhard Gentzen - 1969 - Amsterdam,: North-Holland Pub. Co.. Edited by M. E. Szabo.
    Download  
     
    Export citation  
     
    Bookmark   114 citations  
  • A Mathematical Introduction to Logic.Herbert Enderton - 2001 - Bulletin of Symbolic Logic 9 (3):406-407.
    Download  
     
    Export citation  
     
    Bookmark   190 citations  
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Download  
     
    Export citation  
     
    Bookmark   599 citations  
  • The Logic of Provability.Philip Scowcroft - 1995 - Philosophical Review 104 (4):627.
    This is a book that every enthusiast for Gödel’s proofs of his incompleteness theorems will want to own. It gives an up-to-date account of connections between systems of modal logic and results on provability in formal systems for arithmetic, analysis, and set theory.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Arithmetization of Metamathematics in a General Setting.Solomon Feferman - 1960 - Journal of Symbolic Logic 31 (2):269-270.
    Download  
     
    Export citation  
     
    Bookmark   92 citations  
  • A note on the undefinability of cuts.J. B. Paris & C. Dimitracopoulos - 1983 - Journal of Symbolic Logic 48 (3):564-569.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Transfinite Recursive Progressions of Axiomatic Theories.Solomon Feferman - 1967 - Journal of Symbolic Logic 32 (4):530-531.
    Download  
     
    Export citation  
     
    Bookmark   37 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  
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   480 citations  
  • Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
    Download  
     
    Export citation  
     
    Bookmark   90 citations  
  • A survey of proof theory.G. Kreisel - 1968 - Journal of Symbolic Logic 33 (3):321-388.
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • (1 other version)Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
    Download  
     
    Export citation  
     
    Bookmark   109 citations  
  • (1 other version)Metamathematics of First-Order Arithmetic.Petr Hajék & Pavel Pudlák - 1994 - Studia Logica 53 (3):465-466.
    Download  
     
    Export citation  
     
    Bookmark   145 citations  
  • On a Generalized Logic Calculus.Gaisi Takeuti - 1957 - Journal of Symbolic Logic 22 (4):351-352.
    Download  
     
    Export citation  
     
    Bookmark   9 citations