草稿:使用序数赋值形式化验证皮亚诺算术一致性的构造性证明
DRAFT: A Formally Verified Constructive Proof of the Consistency of Peano Arithmetic Using Ordinal Assignments
AI总结:
本文通过序数赋值形式化验证皮亚诺算术一致性的构造性证明,并使用Coq定理证明器验证所有结果。
摘要:
格伦岑1936年对皮亚诺算术一致性的证明是数学基础领域的重要成果。本文提供了一个基于哥德尔改写版本的证明修改版,并包含额外的细节和小修正,这些是必要地证明在构造性环境中切消论证的良基性。所有结果都已使用Coq定理证明器验证。注释给读者2026年2月26日:这是一份我们原本打算提交给《自动推理杂志》的草稿,我们没有特别的时间线,因为这项工作是2023年安大略大学亚伦荣誉项目的一部分。为此,我们使用了斯普林格样式文件。我们将其上传到arXiv,因为似乎对这项工作的兴趣如在2026年2月初的https://proofassistants.stackexchange.com/questions/6462/how-far-is-gentzens-consistency-proof-of-peano-arithmetic-from-being-formalized上所显示的那样。Coq代码可用在此处:https://github.com/aarondroidbryce/Gentzen/tree/master
英文摘要:
Gentzen's 1936 proof of the consistency of Peano Arithmetic was a significant result in the foundations of mathematics. We provide here a modified version of the proof, based on Gödel's reformulation, and including additional details and minor corrections which are necessary to definitively prove the well-foundedness of the cut-elimination argument in a constructive environment. All results have been verified using the Coq theorem prover. NOTE TO READERS 26 February 2026: this is a draft which we had intended to submit to the Journal of Automated Reasoning with no particular time-line in our minds as the work was completed as part of Aaron's honours project at ANU in 2023. For that reason, we have used the Springer style files. We are putting it on arxiv as there appears to be some interest in this work as indicated by a post to https://proofassistants.stackexchange.com/questions/6462/how-far-is-gentzens-consistency-proof-of-peano-arithmetic-from-being-formalized in early February 2026. The Coq code is available here: https://github.com/aarondroidbryce/Gentzen/tree/master
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。