Predicatively unprovable termination of the Ackermannian Goodstein process

  title={Predicatively unprovable termination of the Ackermannian Goodstein process},
  author={Toshiyasu Arai and David Fern'andez-Duque and Stanley S. Wainer and Andreas Weiermann},
  journal={Proceedings of the American Mathematical Society},
The classical Goodstein process gives rise to long but finite sequences of natural numbers whose termination is not provable in Peano arithmetic. In this manuscript we consider a variant based on the Ackermann function. We show that Ackermannian Goodstein sequences eventually terminate, but this fact is not provable using predicative means. 

Intermediate Goodstein principles

The original Goodstein process proceeds by writing natural numbers in nested exponential k -normal form, then successively raising the base to k + 1 and subtracting one from the end result. Such

Ackermann and Goodstein go functorial

We present variants of Goodstein's theorem that are equivalent to arithmetical comprehension and to arithmetical transfinite recursion, respectively, over a weak base theory. These variants differ

Fast Goodstein Walks

We define a variant of the Goodstein process based on fast-growing functions and show that it terminates, although this fact is not provable in Kripke-Platek set theory (or other theories of

A walk with Goodstein

The notion of base-change maximality is introduced, and it is shown how it leads to far-reaching extensions of Goodstein's result.

Giant and illusionary giant Goodstein principles.

We analyze several natural Goodstein principles which themselves are defined with respect to the Ackermann function and the extended Ackermann function. These Ackermann functions are well established


The key is the so-called “Hardy hierarchy” of proof-theoretic bounding finctions, providing a uniform method for associating Goodstein-type sequences with parameterized normal form representations of positive integers.

Beyond the Horizon of Computability: 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings

Read Mapping Through Hardware/Software Co-design Through hardware/ software co-design is explored through hardware-based and software-based approaches.


It is argued that also the successful use of proof-theoretic methods in core mathematics in recent decades was made possible by developing logical metatheorems tailored for applications to particular classes of theorems and proofs in specific areas of mathematics.

Ackermannian Goodstein Sequences of Intermediate Growth

Two new Goodstein processes for notations for natural numbers based on the Ackermann function are defined, obtaining new independence results for theories of second order arithmetic related to the existence of Turing jumps.



Classifying the Provably Total Functions of PA

A self-contained and streamlined version of the classification of the provably computable functions of PA that focuses on illuminating as well as seems possible the intrinsic computational character of the standard cut elimination process.

Independence of Ramsey theorem variants using ε 0 ∗

We discuss the nite adjacent Ramsey theorem, one of the most recent independence results in Peano Arithmetic, and show some fascinating connections with two of the earliest examples of natural

Systems of predicative analysis, II: Representations of ordinals

  • S. Feferman
  • Philosophy, Mathematics
    Journal of Symbolic Logic
  • 1968
The eventual purpose of this paper is to provide certain specific representations of ordinals and develop their basic properties as needed for the proofs of the results announced in [3]. Since the

Accessible Independence Results for Peano Arithmetic

Recently some interesting first-order statements independent of Peano Arithmetic (P) have been found. Here we present perhaps the first which is, in an informal sense, purely number-theoretic in

Some interesting connections between the slow growing hierarchy and the Ackermann function

It is shown in this paper that (Gα)α∈T matches up with the class of functions which are elementary recursive in the Ackermann function as does (by folklore).

On the restricted ordinal theorem

Gentzen proves the theorem of transfinite induction, which he requires, by an intuitive argument, by utilising transfinitely induction to prove that certain sequences of reduction processes, enumerated by ordinals less than e, are finite.

A short proof of two recently discovered independence results using recursion theoretic methods

Recently L. A. S. Kirby and J. Paris showed that a theorem of R L. Goodstein cannot be proved in Peano's Arithmetic. We give an alternative short proof of their result, based only on well established

Subsystems of second order arithmetic

The results show clear trends in the development of mathematics within Subsystems of Z2 and in particular in the areas of arithmetical comprehension and models of Sub system design.

Transfinite ordinals in recursive number theory

This paper constructs a representation, by functions of number-theoretic variables, for ordinals of any type, in recursive number theory, and introduces majorant variables σ, ω , ω r, r ≧ 1.