Switch to: Citations

Add references

You must login to add references.
  1. A mathematical incompleteness in Peano arithmetic.Jeff Paris & Leo Harrington - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 90--1133.
    Download  
     
    Export citation  
     
    Bookmark   63 citations  
  • Sentences undecidable in formalized arithmetic: an exposition of the theory of Kurt Gödel.Andrzej Mostowski - 1952 - Westport, Conn.: Greenwood Press.
    The famous theory of undecidable sentences created by Kurt Godel in 1931 is presented as clearly and as rigorously as possible. Introductory explanations beginning with the necessary facts of arithmetic of integers and progressing to the theory of representability of arithmetical functions and relations in the system (S) prepare the reader for the systematic exposition of the theory of Godel which is taken up in the final chapter and the appendix.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Some results on speed-up.Tsuyoshi Yukami - 1984 - Annals of the Japan Association for Philosophy of Science 6 (4):195-205.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Bounds for proof-search and speed-up in the predicate calculus.Richard Statman - 1978 - Annals of Mathematical Logic 15 (3):225.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Cuts, consistency statements and interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.
    Download  
     
    Export citation  
     
    Bookmark   57 citations  
  • Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
    Download  
     
    Export citation  
     
    Bookmark   89 citations  
  • A Hierarchy of Cuts in Models of Arithmetic.J. B. Paris, L. Pacholski, J. Wierzejewski, A. J. Wilkie, George Mills & Jussi Ketonen - 1986 - Journal of Symbolic Logic 51 (4):1062-1066.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • The number of proof lines and the size of proofs in first order logic.Jan Krajíček & Pavel Pudlák - 1988 - Archive for Mathematical Logic 27 (1):69-84.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • Construction of Satisfaction Classes for Nonstandard Models.Henryk Kotlarski, Stanislav Krajewski & Alistair H. Lachlan - 1981 - Canadian Mathematical Bulletin 24 (1):283--93.
    Download  
     
    Export citation  
     
    Bookmark   34 citations