"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.
早期的论文“Introduction to clarithmetic I”构建了一个基于可计算性逻辑的算术公理系统(见http://www.cis.upenn.edu/linggiorgi/cl.html),并证明了它在多项式时间可计算性方面的可靠性和扩展完备性。本文阐述了三个额外的声音和完整的系统在相同的风格和意义:一个多项式空间可计算性,一个基本的递归时间(和/或空间)可计算性,和一个原始递归时间(和/或空间)可计算性。
与经典逻辑是真的形式理论一样,最近提出的可计算性逻辑也是可计算性的形式理论。它将(交互式)计算问题理解为机器与环境的博弈,将其可计算性理解为总是赢得博弈的机器的存在,将逻辑运算符理解为计算问题的运算,将逻辑公式的有效性理解为“总是可计算”问题的方案。目前的贡献给出了一个最基本的片段的可计算性逻辑的公理化的合理性和完整性证明的详细阐述。这个片段的逻辑词汇表包含所谓的并行和选择操作的操作符,它的原子代表基本问题,即标准意义上的谓词。这篇文章是自成一体的,因为它解释了所有相关的概念。虽然在技术上没有必要,但是,熟悉基础论文“Introduction to computability logic”[Annals of Pure and Applied Logic 123(2003),pp.1-99]将极大地帮助读者理解可计算性逻辑的哲学,潜在的动机,潜力和实用性,--决定当前结果价值的背景。有关该主题的在线介绍可在http://www.cis.upenn.edu/~giorgi/cl.html和http://www.csc.villanova.edu/~japaridz/CL/gsoll.html上查阅。