Subsystems of true arithmetic and hierarchies of functions

DOI10.1016/0168-0072(93)90031-8zbMath0802.03036OpenAlexW1966414208MaRDI QIDQ688433

Zygmunt Ratajczyk

Publication date: 12 December 1994

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(93)90031-8

zbMATH Keywords

transfinite inductionskeletoncombinatorial reflexion principlesHardy hierarchyprovably total recursive functions

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items

More on lower bounds for partitioning \(\alpha\)-large sets ⋮ The contribution of Zygmunt Ratajczyk to the foundations of arithmetic ⋮ Bootstrapping. I ⋮ A Model-Theoretic Approach to Ordinal Analysis ⋮ An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency ⋮ Partitioning 𝛼–large sets: Some lower bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inductive full satisfaction classes
• Proof theory. 2nd ed
• Rapidly growing Ramsey functions
• Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
• More on induction in the language with a satisfaction class
• Satisfaction Classes and Combinatorial Sentences Independent From PA
• Locally finite theories
• Combinatorial principles concerning approximations of functions
• Hilbert's program relativized; Proof-theoretical and foundational reductions
• A combinatorial analysis of functions provably recursive in $ΙΣ_n$
• Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
• Postscript to “built-up systems of fundamental sequences and hierarchies of number-theoretic functions”
• Arithmetical transfinite induction and hierarchies of functions
• Systems of predicative analysis, II: Representations of ordinals
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Hierarchies of number-theoretic functions II
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
• Transfinite recursive progressions of axiomatic theories
• On the interpretation of non-finitist proofs–Part II