Predicatively unprovable termination of the Ackermannian Goodstein process
DOI10.1090/proc/14813zbMath1484.03125arXiv1906.00020OpenAlexW2982685337WikidataQ126862778 ScholiaQ126862778MaRDI QIDQ5113418
Toshiyasu Arai, Stanley S. Wainer, David Fernández-Duque, Andreas Weiermann
Publication date: 11 June 2020
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.00020
First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Gödel numberings and issues of incompleteness (03F40)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof theory. The first step into impredicativity
- Harvey Friedman's research on the foundations of mathematics
- Some interesting connections between the slow growing hierarchy and the Ackermann function
- Independence of Ramsey theorem variants using $\varepsilon _0$
- Sharp phase transition thresholds for the Paris Harrington Ramsey numbers for a fixed dimension
- Classifying the Provably Total Functions of PA
- Accessible Independence Results for Peano Arithmetic
- A Uniform Approach to Fundamental Sequences and Hierarchies
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
- ACKERMANNIAN GOODSTEIN PRINCIPLES FOR FIRST ORDER PEANO ARITHMETIC
- Systems of predicative analysis
- Systems of predicative analysis, II: Representations of ordinals
- Ramsey’s theorem for 𝑛-dimensional arrays
- Transfinite ordinals in recursive number theory
- On the restricted ordinal theorem
- The consistency of arithmetics
This page was built for publication: Predicatively unprovable termination of the Ackermannian Goodstein process
