Subsystems of true arithmetic and hierarchies of functions
From MaRDI portal
(Redirected from Publication:688433)
Recommendations
- scientific article; zbMATH DE number 1215495
- Elementary descent recursion and proof theory
- Arithmetical transfinite induction and hierarchies of functions
- Paris-Harrington principles, reflection principles and transfinite induction up to \(\epsilon _ 0\)
- Proofs and computations
- Goodstein's function
- Transfinite induction within Peano arithmetic
- Some variations of the Hardy hierarchy
- Some combinatorial principles equivalent to restrictions of transfinite induction up to \(\Gamma _ 0\)
- Functions provably total in $I^{-}Σ_{n}$
Cites work
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3878922 (Why is no real title available?)
- scientific article; zbMATH DE number 3946114 (Why is no real title available?)
- scientific article; zbMATH DE number 4033742 (Why is no real title available?)
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 3668596 (Why is no real title available?)
- scientific article; zbMATH DE number 3700836 (Why is no real title available?)
- scientific article; zbMATH DE number 3528224 (Why is no real title available?)
- scientific article; zbMATH DE number 3355016 (Why is no real title available?)
- scientific article; zbMATH DE number 3110307 (Why is no real title available?)
- A combinatorial analysis of functions provably recursive in $ΙΣ_n$
- Arithmetical transfinite induction and hierarchies of functions
- Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
- Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
- Combinatorial principles concerning approximations of functions
- Hierarchies of number-theoretic functions II
- Hilbert's program relativized; Proof-theoretical and foundational reductions
- Inductive full satisfaction classes
- Locally finite theories
- More on induction in the language with a satisfaction class
- On the interpretation of non-finitist proofs–Part II
- Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
- Postscript to “built-up systems of fundamental sequences and hierarchies of number-theoretic functions”
- Proof theory. 2nd ed
- Rapidly growing Ramsey functions
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
- Satisfaction Classes and Combinatorial Sentences Independent From PA
- Systems of predicative analysis, II: Representations of ordinals
- Transfinite recursive progressions of axiomatic theories
Cited in
(10)- Some variations of the Hardy hierarchy
- Bootstrapping. I
- Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
- The contribution of Zygmunt Ratajczyk to the foundations of arithmetic
- An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency
- More on lower bounds for partitioning \(\alpha\)-large sets
- Partitioning 𝛼–large sets: Some lower bounds
- Arithmetical transfinite induction and hierarchies of functions
- A Model-Theoretic Approach to Ordinal Analysis
- scientific article; zbMATH DE number 3904585 (Why is no real title available?)
This page was built for publication: Subsystems of true arithmetic and hierarchies of functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688433)
