可反驳性与可证明性一样具有递归性
Refutability as Recursive as Provability
AI总结:
本文在原始递归框架下定义可反驳性谓词 Rf(x,v),考察其与可证明性谓词 Pf(x,v) 的交互关系,从而为不完备性论证及相关概念编码提供新视角。
摘要:
Gödel编号是对语法的算术化,它通过编码一个原始递归谓词 Pf(x,v) 来定义可证明性。如今,围绕这一著名递归谓词的大量研究和成果广泛分布于逻辑学与人工智能的许多领域。相比之下,同样通过Gödel编号、在相同原始递归地位内定义的可反驳性谓词,却未得到同等程度的研究。Rf(x,v) 可被定义为一个递归谓词,意思是 x 是对Gödel编号为 v 的公式在 PA 中进行反驳的Gödel编号。本文对可证明性谓词与可反驳性谓词在相同递归地位下定义时的交互联系进行了逻辑研究。所得引理具有澄清作用,并为不完备性论证及其底层概念的编码开辟了新视角。
英文摘要:
Godel numbering is an arithmetization of sintax which defines provability by coding a primitive recursive predicate, Pf(x,v). A multiplicity of researches and results all around this well-known recursive predicate are today widespread in many areas of logic and AI. Not equally investigated is the refutability predicate defined by Godel numbering within the same primitive recursive status. Rf(x,v) can be defined as a recursive predicate meaning that x is the Godel number of a refutation in PA of the formula with Godel number v. This article proposes a logical investigation of the interactive links between provability and refutability predicates when defined within the same recursive status. The resulting Lemmas are clarifying and open new perspectives for the incompleteness argument and the codings of its underlying notions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。