Introduction to clarithmetic I
arXiv:1003.4719 · doi:10.1016/j.ic.2011.07.002
Abstract
"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.
References in corpus (16)
- Sequential operators in computability logic
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- Propositional computability logic I
- Cirquent calculus deepened
- Computability Logic: a formal theory of interaction
- From truth to computability I
- The intuitionistic fragment of computability logic at the propositional level
- Propositional Computability Logic II
- Intuitionistic computability logic
- From truth to computability II
- Many concepts and two logics of algorithmic reduction
- Toggling operators in computability logic
- The logic of interactive Turing reduction
- Introduction to clarithmetic II
- Towards applied theories based on computability logic
- A logical basis for constructive systems