Introduction to clarithmetic. I
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4066875 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- A game semantics for linear logic
- A logical basis for constructive systems
- A new “feasible” arithmetic
- An arithmetic for non-size-increasing polynomial-time computation
- An arithmetic for polynomial-time computation
- Bounded arithmetic for NC, ALogTIME, L and NL
- Bounded linear logic: A modular approach to polynomial-time computability
- Cirquent Calculus Deepened
- Computability logic: a formal theory of interaction
- Degrees of indeterminacy of games
- From truth to computability. I.
- From truth to computability. II.
- Games and full completeness for multiplicative linear logic
- In the beginning was game semantics
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- Introduction to clarithmetic. II
- Introduction to clarithmetic. III
- Introduction to computability logic
- Intuitionistic computability logic
- Knowledge representation and reasoning based on computability logic
- Light linear logic
- Many concepts and two logics of algorithmic reduction
- On abstract resource semantics and computability logic
- Propositional computability logic I
- Propositional computability logic II
- Sequential operators in computability logic
- The intuitionistic fragment of computability logic at the propositional level
- The logic of interactive turing reduction
- Toggling operators in computability logic
- Towards applied theories based on computability logic
Cited in
(8)- Arithmetics base on computability logic
- A logical basis for constructive systems
- A PSPACE-complete first-order fragment of computability logic
- The taming of recurrences in computability logic through cirquent calculus. I
- Build your own clarithmetic. I: Setup and completeness
- Build your own clarithmetic. II: Soundness
- Introduction to clarithmetic. II
- Introduction to clarithmetic. III
This page was built for publication: Introduction to clarithmetic. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642523)
