Subsystems of true arithmetic and hierarchies of functions

DOI10.1016/0168-0072(93)90031-8zbMATH Open0802.03036OpenAlexW1966414208MaRDI QIDQ688433FDOQ688433

Authors: 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

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}$

zbMATH Keywords

skeletontransfinite inductioncombinatorial reflexion principlesHardy hierarchyprovably total recursive functions

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cites Work

• Title not available (Why is that?)
• On the interpretation of non-finitist proofs–Part II
• Proof theory. 2nd ed
• Rapidly growing Ramsey functions
• Title not available (Why is that?)
• Systems of predicative analysis, II: Representations of ordinals
• Hierarchies of number-theoretic functions II
• Title not available (Why is that?)
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Transfinite recursive progressions of axiomatic theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
• More on induction in the language with a satisfaction class
• Locally finite theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Satisfaction Classes and Combinatorial Sentences Independent From PA
• Title not available (Why is that?)
• 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
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
• Title not available (Why is that?)
• Inductive full satisfaction classes

Cited In (10)

• 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
• Title not available (Why is that?)
• Some variations of the Hardy hierarchy

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)