Related papers: Intermediate Goodstein principles

Goodstein's principle is arguably the first purely number-theoretic statement known to be independent of Peano arithmetic. It involves sequences of natural numbers which at first appear to grow very quickly, but eventually decrease to zero.…

The classical Goodstein process, defined via hereditary base-$k$ exponential normal form, is a well-known example of a principle unprovable in Peano Arithmetic. In this paper, we generalize this framework by constructing a new Goodstein…

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…

The original Goodstein process is based on writing numbers in hereditary $b$-exponential normal form: that is, each number $n$ is written in some base $b\geq 2$ as $n=b^ea+r$, with $e$ and $r$ iteratively being written in hereditary…

Goodstein sequences are numerical sequences in which a natural number m, expressed as the complete normal form to a given base a, is modified by increasing the value of the base a by one unit and subtracting one unit from the resulting…

In arXiv:2508.14768, a variant of Goodstein's original process was recently introduced which, given a set $B\subseteq \mathbb{N}$ of bases, writes each $n\in\mathbb{N}$ in $B$-normal form, namely $n=b^ea+r$, where $b\in B$ the greatest base…

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 canonical fast growing functions labeled…

Stochastic processes are proposed whose master equations coincide with classical wave, telegraph, and Klein-Gordon equations. Similar to predecessors based on the Goldstein-Kac telegraph process, the model describes the motion of particles…

We assumed that, for every natural number k, there is a natural number u such that the (k-1)th term of G(u) is k^k, and that G(u) terminates finitely. It immediately follows that every Goodstein Sequence G(m) over the natural numbers must…

Natural numbers are represented by Grzegorczyk functions. The representation is implicit in the technique of H. Friedman. An iterated base-shift in the representation with subtracting 1 yields a sequence, Grzegorczyk sequence. It is shown…

I present a covariant approach to developing 1+3 formalism without an introduction of any basis or coordinates. In the formalism, a spacetime which has a timelike congruence is assumed. Then, tensors are split into temporal and spatial…

We show that the twisted second moments of the Riemann zeta function averaged over the arithmetic progression $1/2 + i(an + b)$ with $a > 0$, $b$ real, exhibits a remarkable correspondance with the analogous continuous average and derive…

We use reverse mathematics to analyze "iterated jump" versions of the following four principles: the atomic model theorem with subenumerable types (AST), the diagonally noncomputable principle (DNR), weak weak K\H{o}nig's lemma (WWKL), and…

Let $b \geq 3$ be a positive integer. A natural number is said to be a base-$b$ Zuckerman number if it is divisible by the product of its base-$b$ digits. Let $\mathcal{Z}_b(x)$ be the set of base-$b$ Zuckerman numbers that do not exceed…

We define a variant of the Goodstein process based on fast-growing functions and show that it terminates, but this fact is not provable in Kripke-Platek set theory or other theories of strength the Bachmann-Howard ordinal. We moreover show…

Inspired by Gentzen's 1936 consistency proof, Goodstein found a close fit between descending sequences of ordinals epsilon_0 and sequences of integers, now known as Goodstein sequences. This article revisits Goodstein's 1944 paper. In light…

This paper presents some considerations about the Goldbach's conjecture (GC). The work is based on elementary results of the number theory and it provides a constructive method that permits, given an even integer, to find at least a pair of…

We give an effective procedure that produces a natural number in its output from any natural number in its input, that is, it computes a total function. The elementary operations of the procedure are Turing-computable. The procedure has a…

Goodstein's argument is essentially that the hereditary representation m_{[b]} of any given natural number m in the natural number base b can be mirrored in Cantor Arithmetic, and used to well-define a finite decreasing sequence of…

We consider additive functionals of systems of random measures whose initial configuration is given by a Poisson point process, and whose individual components evolve according to arbitrary Markovian or non-Markovian measure valued…