GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION

DOI10.1017/BSL.2021.30MaRDI QIDQ4959664zbMATH OpenOpenAlexFDO

Authors Toshiyasu Arai, Stanley S. Wainer, Andreas Weiermann

Publication date 17 September 2021

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/bsl.2021.30

zbMATH Keywords

independence resultsHardy hierarchyproof-theoretic ordinalsfast-growing functions

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15) Relative consistency and interpretations (03F25)

Recommendations

• Ackermannian Goodstein sequences of intermediate growth
• Predicatively unprovable termination of the Ackermannian Goodstein process
• Ackermann and Goodstein go functorial
• Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal
• Ackermannian Goodstein principles for first order Peano arithmetic

Cites work

• scientific article; zbMATH DE number 4031679 (Why is no real title available?)
• scientific article; zbMATH DE number 4033742 (Why is no real title available?)
• scientific article; zbMATH DE number 1215495 (Why is no real title available?)
• A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
• A Uniform Approach to Fundamental Sequences and Hierarchies
• Accessible Independence Results for Peano Arithmetic
• Classifying the Provably Total Functions of PA
• Goodstein sequences for prominent ordinals up to the ordinal of \(\Pi^1_1\)-\(\mathrm{CA}_0\)
• Goodstein's theorem revisited
• On the relation between choice and comprehension principles in second order arithmetic
• On the restricted ordinal theorem
• Ordinal Analysis with an Introduction to Proof Theory
• Predicatively unprovable termination of the Ackermannian Goodstein process
• Proofs and computations
• Some results on cut-elimination, provable well-orderings, induction and reflection
• Systems of predicative analysis, II: Representations of ordinals
• The slow-growing and the Graegorczyk hierarchies

Cited in

(3)

• A walk with Goodstein and Ackermann
• Intermediate Goodstein Principles
• Fast Goodstein walks

This page was built for publication: GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959664)