Switch to: Citations

Add references

You must login to add references.
  1. (2 other versions)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 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  
  • Inductive Full Satisfaction Classes.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Annals of Pure and Applied Logic 47 (1):199--223.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • (2 other versions)Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems.Georg Kreisel & Azriel Lévy - 1968 - Zeitschrift für Mathematische Logic Und Grundlagen der Mathematik 14 (1):97--142.
    Download  
     
    Export citation  
     
    Bookmark   62 citations  
  • Hierarchies of number-theoretic functions. I.M. H. Löb & S. S. Wainer - 1970 - Archive for Mathematical Logic 13 (1-2):39-51.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • On the interpretation of non-finitist proofs–Part II.G. Kreisel - 1952 - Journal of Symbolic Logic 17 (1):43-58.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy.S. S. Wainer - 1972 - Journal of Symbolic Logic 37 (2):281-292.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Locally finite theories.Jan Mycielski - 1986 - Journal of Symbolic Logic 51 (1):59-62.
    We say that a first order theoryTislocally finiteif every finite part ofThas a finite model. It is the purpose of this paper to construct in a uniform way for any consistent theoryTa locally finite theory FIN which is syntactically isomorphic toT.Our construction draws upon the main idea of Paris and Harrington [6] and generalizes the syntactic aspect of their result from arithmetic to arbitrary theories. The first mathematically strong locally finite theory, called FIN, was defined in [1]. Now we get (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (1 other version)More on induction in the language with a satisfaction class.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Mathematical Logic Quarterly 36 (5):441-454.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Hierarchies of number-theoretic functions II.M. H. Löb & S. S. Wainer - 1970 - Archive for Mathematical Logic 13 (3-4):97-113.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (2 other versions)Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems.G. Kreisel & A. Lévy - 1968 - Mathematical Logic Quarterly 14 (7-12):97-142.
    Download  
     
    Export citation  
     
    Bookmark   70 citations  
  • Postscript to “built-up systems of fundamental sequences and hierarchies of number-theoretic functions”.Diana Schmidt - 1977 - Archive for Mathematical Logic 18 (1):145-146.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Satisfaction Classes and Combinatorial Sentences Independent From PA.Z. Ratajczyk - 1982 - Mathematical Logic Quarterly 28 (8‐12):149-165.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Systems of predicative analysis, II: Representations of ordinals.Solomon Feferman - 1968 - Journal of Symbolic Logic 33 (2):193-220.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Hilbert's program relativized: Proof-theoretical and foundational reductions.Solomon Feferman - 1988 - Journal of Symbolic Logic 53 (2):364-384.
    Download  
     
    Export citation  
     
    Bookmark   64 citations  
  • (1 other version)Satisfaction Classes and Combinatorial Sentences Independent FromPA.Z. Ratajczyk - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (8-12):149-165.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Beweisbarkeit und Unbeweisbarkeit von Anfangsfallen der Transfiniten Induktion in der reinen Zahlentheorie.Gerhard Gentzen - 1944 - Journal of Symbolic Logic 9 (3):70-72.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Some Classes of Recursive Functions.Andrzej Grzegorczyk - 1955 - Journal of Symbolic Logic 20 (1):71-72.
    Download  
     
    Export citation  
     
    Bookmark   33 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)More on Induction in the Language with a Satisfaction Class.Henryk Kotlarski & Zygmunt Ratajczyk - 1990 - Zeitshift für Mathematische Logik Und Grundlagen der Mathematik 36 (1):441--54.
    Download  
     
    Export citation  
     
    Bookmark   11 citations