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

论语法的算术化

On the arithmetization of syntax

Stephen Boyce

AI总结:

本文通过分析PA语法算术化导致的悖论,指出PA定理类定义不明确,并证明Gödel句的否定蕴含自身,从而揭示元数学定义中避免悖论的机制失效。

摘要:

普遍认为,一阶数论(PA)的不完备性是通过应用哥德尔证明建立的。本文表明,PA语法的算术化意味着假定的PA定理类不是良定义的。这是因为,如果使用系统自身的公理和推理规则可以形式证明(或反驳)一个公式的证明的哥德尔数的存在,那么该公式的定理性(或非定理性)就被蕴含。因此,PA的一个定理是:PA的哥德尔句的否定(Not G)蕴含G本身,即((Not G) => G)是PA定理;由此,G的定理性和非定理性都可以被确立。结论被视为证据,表明在元数学定义(如证明、形式理论等)中依赖的避免悖论的机制失效。主要命题仅使用已有文献中已被接受的证明所支持的假设推导得出。

英文摘要:

It is generally accepted that the incompleteness of first-order number theory (PA) is established by an application of Godel's proof. This paper shows that the arithmetization of the syntax of PA implies that the hypothesised class of PA theorems is not well defined. This is a consequence of the fact that the theoremhood (or non-theoremhood) of a PA formula is implied if the existence of a Godel number of a proof of the formula may be formally proved (or disproved respectively), using the systems own axioms and inference rules. Hence it is a PA theorem that the the negation of a Godel sentence for PA (Not G) implies G itself, i.e. ((Not G) => G) is a PA theorem; from which, both the theoremhood and non-theoremhood of G may be established. The conclusion is taken as evidence of a failure of the devices relied upon for the avoidance of paradox in metamathematical definitions of a proof, a formal theory etc. The main proposition is derived using only assumptions supported by proofs already accepted in the existing literature.

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

↑