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

澄清法III介绍

Introduction to clarithmetic III

Giorgi Japaridze

摘要:

本文构造了三个新的基于可计算性逻辑的算术系统:CLA 8、CLA 9和CLA 10。系统CLA 8被证明是健全的和扩展完整的PA可证明递归时间可计算性。这是在某种意义上说,算术问题A有一个t-时间的解决方案,一些PA-可证明递归函数t当且仅当A是由某些定理CLA 8。系统CLA 9被证明是健全的和内涵完整的建设性PA可证明的可计算性。这是因为一个句子X是CLA 9的一个定理当且仅当,对于某个特定的机器M,PA证明了M计算X(表示的问题)。系统CLA 10被证明是健全的,内涵完整的不一定建设性PA证明可计算性。这意味着一个句子X是CLA 10的一个定理当且仅当PA证明X是可计算的,即使PA不“知道”任何特定的机器M计算X。

英文摘要:

The present paper constructs three new systems of clarithmetic (arithmetic based on computability logic --- see http://www.cis.upenn.edu/~giorgi/cl.html): CLA8, CLA9 and CLA10. System CLA8 is shown to be sound and extensionally complete with respect to PA-provably recursive time computability. This is in the sense that an arithmetical problem A has a t-time solution for some PA-provably recursive function t iff A is represented by some theorem of CLA8. System CLA9 is shown to be sound and intensionally complete with respect to constructively PA-provable computability. This is in the sense that a sentence X is a theorem of CLA9 iff, for some particular machine M, PA proves that M computes (the problem represented by) X. And system CLA10 is shown to be sound and intensionally complete with respect to not-necessarily-constructively PA-provable computability. This means that a sentence X is a theorem of CLA10 iff PA proves that X is computable, even if PA does not "know" of any particular machine M that computes X.

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

↑