Goodstein Sequences Based on a Parametrized Ackermann–Péter Function

Bulletin of Symbolic Logic 27 (2):168-186 (2021)
  Copy   BIBTEX

Abstract

Following our [6], though with somewhat different methods here, further variants of Goodstein sequences are introduced in terms of parameterized Ackermann–Péter functions. Each of the sequences is shown to terminate, and the proof-theoretic strengths of these facts are calibrated by means of ordinal assignments, yielding independence results for a range of theories: PRA, PA,$\Sigma ^1_1$-DC$_0$, ATR$_0$, up to ID$_1$. 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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Reflection ranks and ordinal analysis.Fedor Pakhomov & James Walsh - 2021 - Journal of Symbolic Logic 86 (4):1350-1384.
A Walk with Goodstein.David Fernández-Duque & Andreas Weiermann - 2024 - Bulletin of Symbolic Logic 30 (1):1-19.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.

Analytics

Added to PP
2022-11-14

Downloads
6 (#1,484,933)

6 months
5 (#710,385)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On the restricted ordinal theorem.R. L. Goodstein - 1944 - Journal of Symbolic Logic 9 (2):33-41.
The slow-growing and the grzecorczyk hierarchies.E. A. Cichon & S. S. Wainer - 1983 - Journal of Symbolic Logic 48 (2):399-408.

View all 6 references / Add more references