GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION
From MaRDI portal
Publication:4959664
DOI10.1017/bsl.2021.30OpenAlexW3199560146MaRDI QIDQ4959664
Andreas Weiermann, Stanley S. Wainer, Toshiyasu Arai
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
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) Hierarchies of computability and definability (03D55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Goodstein sequences for prominent ordinals up to the ordinal of \(\Pi^1_1\)-\(\mathrm{CA}_0\)
- Some results on cut-elimination, provable well-orderings, induction and reflection
- Proofs and Computations
- Classifying the Provably Total Functions of PA
- The slow-growing and the Graegorczyk hierarchies
- On the relation between choice and comprehension principles in second order arithmetic
- Accessible Independence Results for Peano Arithmetic
- A Uniform Approach to Fundamental Sequences and Hierarchies
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
- Predicatively unprovable termination of the Ackermannian Goodstein process
- Ordinal Analysis with an Introduction to Proof Theory
- Goodstein’s Theorem Revisited
- Systems of predicative analysis, II: Representations of ordinals
- On the restricted ordinal theorem
This page was built for publication: GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION