GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION
DOI10.1017/BSL.2021.30OpenAlexW3199560146MaRDI QIDQ4959664FDOQ4959664
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
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proofs and Computations
- Systems of predicative analysis, II: Representations of ordinals
- Ordinal Analysis with an Introduction to Proof Theory
- On the restricted ordinal theorem
- The slow-growing and the Graegorczyk hierarchies
- 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
- 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
- Classifying the Provably Total Functions of PA
- On the relation between choice and comprehension principles in second order arithmetic
- Predicatively unprovable termination of the Ackermannian Goodstein process
- Goodstein’s Theorem Revisited
Cited In (1)
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)
