arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.34548math.LOcs.LOcs.PL
收藏

归纳式基础算术:古德斯坦、九头蛇与$Γ_0$

Inductive Grounded Arithmetic: Goodstein, the Hydra, and $Γ_0$

EPFL(瑞士联邦理工学院)

Bryan Ford

AI总结:

本文提出归纳式基础算术(IGA),其规则经Isabelle/HOL机器验证可靠且一致,可直接证明古德斯坦定理、九头蛇博弈等,还关联$Γ_0$与排中律实例,完成相关序数记号的良基性证明。

摘要:

当逻辑是基础的(即一个句子仅在存在终止过程使其为真时才为真)时,递归定义意味着什么?克里普克针对真这一特殊情况给出的答案是最小不动点。本文将该答案作为一条规则。反思式基础算术(RGA)已能将任何递归定义(包括悖论)写为一个自指项。归纳式基础算术(IGA)为每个正项添加了消去规则,使得可达性、博弈的必胜位置以及基础真本身都拥有各自的归纳原理。该规则对ω模型是可靠的,且该系统是一致的,两者均在Isabelle/HOL中完成了机器验证。借助该规则,IGA直接证明了古德斯坦定理(在一种无蕴含且假设未被判定的逻辑中),以及基尔比-帕里斯九头蛇博弈的原始递归策略,且算术的每一步都是基础推导;它还证明了康托尔范式是良基的,由此可推出HOL中标准$ε_0$记号系统的良基性,同时验证了维布伦记号是每个$φ(n,0)$之下的序数。它将RGA自身语言的克里普克真定义为一个与ω模型完全一致的不动点。两个等价关系确定了经典世界有而基础世界没有的东西:IGA证明整个维布伦记号是良基的,当且仅当它承认该阶的可达性具有二值性;而某阶的可达性具有二值性是可靠的,当且仅当该阶是良基的;因此$Γ_0$最多只差一个排中律实例(针对该记号的可达性谓词),且该实例、良基性语句以及克林的$\boldsymbol{\text{O}}$的原始递归形式中的一个成员声明,在IGA上是可互推的。

英文摘要:

What does a recursive definition mean in a grounded logic, where a sentence is true only if a terminating process makes it so? This paper takes Kripke's answer for truth, the least fixed point, as a rule. Reflective Grounded Arithmetic (RGA) writes any recursive definition as one self-referential term; Inductive Grounded Arithmetic (IGA) adds the elimination rule for every positive one, making each an inductive definition. IGA is omega-sound and proof-grounded: sound and complete for a semantics whose certificates are its own proofs. IGA proves Goodstein's theorem, the Kirby-Paris hydra game for primitive recursive strategies, and, along Gentzen's route, the consistency of Peano Arithmetic. IGA certifies the Veblen notation below every $φ(n,0)$: its accessibility ordinal there is $φ(ω,0)$, that of the paracomplete truth theory PKF. Every theorem is machine-checked in Isabelle/HOL; order types and PKF's ordinal are cited. IGA proves the Veblen notation well-founded exactly when it admits bivalence of accessibility for it, which it does not, and that bivalence is sound exactly when the order is well-founded. So $Γ_0$ lies exactly one instance of excluded middle away, and that instance, the well-foundedness sentence and one membership claim in an internal form of Kleene's $\mathcal{O}$ are interderivable over IGA. Bivalence at the Bachmann-Howard order keeps proof-groundedness. One such claim buys well-foundedness of the countable part of Buchholz's notation at every finite level, of type $ψ_0(Ω_ω)$, and $k$ stratified bivalence rules give a proof-grounded system proving the countable part up to level $k$ well-founded; $k$ iterated closings-off of truth do too, sound only for a closed-off model. Unrestricted conditional proof is inconsistent (Curry's paradox); the purchase is implication at a hypothesis not provably decided.

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

↑