arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.09110math.LO
收藏

与 Goodstein 同行

A walk with Goodstein

David Fernández-Duque, Andreas Weiermann

AI总结:

本文探讨了基于取幂的记号系统的最优性概念,引入基变换最大性,并将其应用于经典 Goodstein 过程及其乘法和 Ackermann 函数变体,从而导出 Goodstein 结果的深远推广。

摘要:

Goodstein 原理可以说是第一个已知独立于 Peano 算术的纯数论命题。它涉及最初似乎增长极快,但最终递减至零的自然数序列。这些序列是相对于基于自然数取幂的记号系统定义的。在本文中,我们探讨了此类记号系统的最优性概念,并将其应用于经典 Goodstein 过程、基于乘法而非取幂的较弱变体,以及基于 Ackermann 函数的更强变体。特别地,我们引入了基变换最大性的概念,并展示了它如何导出 Goodstein 结果的深远推广。

英文摘要:

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. These sequences are defined relative to a notation system based on exponentiation for the natural numbers. In this article, we explore notions of optimality for such notation systems and apply them to the classical Goodstein process, to a weaker variant based on multiplication rather than exponentiation, and to a stronger variant based on the Ackermann function. In particular, we introduce the notion of base-change maximality, and show how it leads to far-reaching extensions of Goodstein's result.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑