From truth to computability. II.
From MaRDI portal
Publication:2373705
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic in computer science (03B70) Metamathematics of constructive systems (03F50) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Applications of game theory (91A80)
Abstract: Computability logic is a formal theory of computational tasks and resources. Formulas in it represent interactive computational problems, and "truth" is understood as algorithmic solvability. Interactive computational problems, in turn, are defined as a certain sort games between a machine and its environment, with logical operators standing for operations on such games. Within the ambitious program of finding axiomatizations for incrementally rich fragments of this semantically introduced logic, the earlier article "From truth to computability I" proved soundness and completeness for system CL3, whose language has the so called parallel connectives (including negation), choice connectives, choice quantifiers, and blind quantifiers. The present paper extends that result to the significantly more expressive system CL4 with the same collection of logical operators. What makes CL4 expressive is the presence of two sorts of atoms in its language: elementary atoms, representing elementary computational problems (i.e. predicates, i.e. problems of zero degree of interactivity), and general atoms, representing arbitrary computational problems. CL4 conservatively extends CL3, with the latter being nothing but the general-atom-free fragment of the former. Removing the blind (classical) group of quantifiers from the language of CL4 is shown to yield a decidable logic despite the fact that the latter is still first-order. A comprehensive online source on computability logic can be found at http://www.cis.upenn.edu/~giorgi/cl.html
Recommendations
Cites work
- A game semantics for linear logic
- Computability logic: a formal theory of interaction
- From truth to computability. I.
- In the beginning was game semantics
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- Introduction to computability logic
- Propositional computability logic I
- Propositional computability logic II
Cited in
(20)- Many concepts and two logics of algorithmic reduction
- The parallel versus branching recurrences in computability logic
- The taming of recurrences in computability logic through cirquent calculus. II
- The taming of recurrences in computability logic through cirquent calculus. I
- The intuitionistic fragment of computability logic at the propositional level
- From truth to computability. I.
- Soundness and completeness of the cirquent calculus system CL6 for computability logic
- Build your own clarithmetic. I: Setup and completeness
- Build your own clarithmetic. II: Soundness
- From formulas to cirquents in computability logic
- Towards applied theories based on computability logic
- Separating the basic logics of the basic recurrences
- Computability logic: a formal theory of interaction
- Computability logic: giving Caesar what belongs to Caesar
- A PSPACE-complete first-order fragment of computability logic
- Toggling operators in computability logic
- Introduction to clarithmetic. I
- A propositional cirquent calculus for computability logic.
- A new face of the branching recurrence of computability logic
- Sequential operators in computability logic
This page was built for publication: From truth to computability. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373705)
