Switch to: Citations

Add references

You must login to add references.
  1. Reflection ranks and ordinal analysis.Fedor Pakhomov & James Walsh - 2021 - Journal of Symbolic Logic 86 (4):1350-1384.
    It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this well-orderedness phenomenon by studying a coarsening of the consistency strength order, namely, the$\Pi ^1_1$reflection strength order. We prove that there are no descending sequences of$\Pi ^1_1$sound extensions of$\mathsf {ACA}_0$in this ordering. Accordingly, we can attach a rank in this order, which we call reflection rank, to any$\Pi (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Reflection Principles in Fragments of Peano Arithmetic.Hiroakira Ono - 1987 - Mathematical Logic Quarterly 33 (4):317-333.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Reflection Principles in Fragments of Peano Arithmetic.Hiroakira Ono - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (4):317-333.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • The optimality of induction as an axiomatization of arithmetic.Daniel Leivant - 1983 - Journal of Symbolic Logic 48 (1):182-184.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • 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   60 citations  
  • 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   69 citations  
  • On parameter free induction schemas.R. Kaye, J. Paris & C. Dimitracopoulos - 1988 - Journal of Symbolic Logic 53 (4):1082-1097.
    We present a comprehensive study of the axiom schemas IΣ - n , BΣ - n (induction and collection schemas for parameter free Σ n formulas) and some closely related schemas.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis.W. A. Howard & G. Kreisel - 1966 - Journal of Symbolic Logic 31 (3):325-358.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.
    We define a class of functions, the descent recursive functions, relative to an arbitrary elementary recursive system of ordinal notations. By means of these functions, we provide a general technique for measuring the proof-theoretic strength of a variety of systems of first-order arithmetic. We characterize the provable well-orderings and provably recursive functions of these systems, and derive various conservation and equiconsistency results.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
    Download  
     
    Export citation  
     
    Bookmark   106 citations  
  • Notation systems for infinitary derivations.Wilfried Buchholz - 1991 - Archive for Mathematical Logic 30 (5-6):277-296.
    Download  
     
    Export citation  
     
    Bookmark   30 citations  
  • Induction rules, reflection principles, and provably recursive functions.Lev D. Beklemishev - 1997 - Annals of Pure and Applied Logic 85 (3):193-242.
    A well-known result states that, over basic Kalmar elementary arithmetic EA, the induction schema for ∑n formulas is equivalent to the uniform reflection principle for ∑n + 1 formulas . We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reflection principles as well. Thus, the closure of EA under the induction rule for ∑n formulas is equivalent to ω times iterated ∑n reflection principle. Moreover, for k < ω, k (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
    Download  
     
    Export citation  
     
    Bookmark   234 citations  
  • Metamathematics of First-Order Arithmetic.Petr Hajék & Pavel Pudlák - 1994 - Studia Logica 53 (3):465-466.
    Download  
     
    Export citation  
     
    Bookmark   138 citations