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

非紧致证明

Non-Compact Proofs

The Graduate Center, the City University of New York(纽约市立大学研究生中心)

Sergei Artemov

AI总结:

本文研究了非紧致证明在PA一致性证明中的作用,指出哥德尔定理禁止紧致证明,但允许非紧致证明在PA内形式化证明PA的一致性。

摘要:

非紧致证明是一类在数学中被使用但未在一致性(un)可证性分析中得到关注的推理方式。我们关注证明算术语句“对于任何自然数n,F(n)”的证明。如果所有F(n)的证明对于n=0,1,2,...都能包含在某个有限公理化的皮亚诺算术PA片段中,则称其为紧致证明。非紧致推理的一个例子是标准的Mostowski 1952年反射定理的证明:PA证明其有限片段的一致性。实际上,哥德尔第二不完全性定理禁止紧致证明,但并不排除在PA中可形式化证明PA一致性的非紧致证明。这解释了最近在PA中证明PA一致性的证明如何运作。它本质上在PA中形式化了Mostowski证明的显式版本,这不在哥德尔定理的范围内。

英文摘要:

Non-compact proofs are a class of reasoning that is used in mathematics but overlooked in the analysis of (un)provability of consistency. We focus on proofs of arithmetical statements (*) "for any natural number n, F(n)." A proof of (*) is called compact if all proofs of F(n)'s for n=0,1,2,... fit into some finitely axiomatized fragment of Peano Arithmetic PA. An example of non-compact reasoning is given by the standard proof of Mostowski's 1952 reflexivity theorem: PA proves the consistency of its finite fragments. It turns out that Gödel's second incompleteness theorem prohibits compact proofs and does not rule out non-compact proofs of PA-consistency formalizable in PA. This explains how the recent proof of PA-consistency in PA works. It essentially formalizes in PA the explicit version of Mostowski's proof, which is not in the scope of Gödel's theorem.

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

↑