Introduction to clarithmetic I

Details Introduction to clarithmetic I Introduction to clarithmetic I

2010-03-24

arxiv.org/abs/1003.4719v6

Information and Computation 209 (2011), pp. 1312-1354

Computer Science

Logic in Computer Science

Scientific paper

10.1016/j.ic.2011.07.002

"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.

Affiliated with

Also associated with

No associations

Rating

Introduction to clarithmetic I does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Introduction to clarithmetic I, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Introduction to clarithmetic I will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57614