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

Clarithmetic I介绍

Introduction to clarithmetic I

Giorgi Japaridze

摘要:

“Clarithmetic”是一个与皮亚诺算术类似的形式数论的通用名称,但基于可计算性逻辑(参见http://www.cis.upenn.edu/classgi/cl.html),而不是更传统的经典或直觉逻辑。claithmetical理论的公式代表交互式计算问题,它们的“真理”被理解为算法解的存在。对这些解决方案施加各种复杂性约束会产生各种版本的clarithmetic。本文介绍了一个多项式时间可计算性的算法体系,该体系是完善的。在这个意义上,系统的每个定理T都代表一个具有多项式时间解的交互数论计算问题,而且,这样的解可以有效地从T的证明中提取出来。完备性的意义在于,每一个具有多项式时间解的交互数论问题都由系统的某个定理T表示。这篇论文是写在semitutorial风格和目标读者事先不熟悉可计算性逻辑。

英文摘要:

"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics. Formulas of clarithmetical theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic solution. Imposing various complexity constraints on such solutions yields various versions of clarithmetic. The present paper introduces a system of clarithmetic for polynomial time computability, which is shown to be sound and complete. Sound in the sense that every theorem T of the system represents an interactive number-theoretic computational problem with a polynomial time solution and, furthermore, such a solution can be efficiently extracted from a proof of T. And complete in the sense that every interactive number-theoretic problem with a polynomial time solution is represented by some theorem T of the system. The paper is written in a semitutorial style and targets readers with no prior familiarity with computability logic.

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

↑