GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN?P?TER FUNCTION
GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN?P?TER FUNCTION
复制标题
基于参数化 ACKERMANN?P?TER 函数的古斯坦序列
DOI:
10.1017/bsl.2021.30
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
WEIERMANN ANDREAS
中科院分区:
文献类型:
--
作者:
ARAI TOSHIYASU;WAINER STANLEY S.;WEIERMANN ANDREAS
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, -DC , ATR , up to ID . 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.