Propositional Computability Logic II

Abstract

Computability logic is a formal theory of computational tasks and resources. Its formulas represent interactive computational problems, logical operators stand for operations on computational problems, and validity of a formula is understood as being a scheme of problems that always have algorithmic solutions. A comprehensive online source on the subject is available at http://www.cis.upenn.edu/~giorgi/cl.html . The earlier article "Propositional computability logic I" proved soundness and completeness for the (in a sense) minimal nontrivial fragment CL1 of computability logic. The present paper extends that result to the significantly more expressive propositional system CL2. What makes CL2 more expressive than CL1 is the presence of two sorts of atoms in its language: elementary atoms, representing elementary computational problems (i.e. predicates), and general atoms, representing arbitrary computational problems. CL2 conservatively extends CL1, with the latter being nothing but the general-atom-free fragment of the former.

25 pages

References in corpus (2)

• Propositional computability logic I
• Computability Logic: a formal theory of interaction

Cited by in corpus (19)

• Sequential operators in computability logic
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• The intuitionistic fragment of computability logic at the propositional level
• Many concepts and two logics of algorithmic reduction
• From truth to computability II
• The taming of recurrences in computability logic through cirquent calculus, Part I
• Toggling operators in computability logic
• From formulas to cirquents in computability logic
• In the beginning was game semantics
• Towards applied theories based on computability logic
• A logical basis for constructive systems
• A new face of the branching recurrence of computability logic
• Introduction to clarithmetic I
• On the system CL12 of computability logic
• The taming of recurrences in computability logic through cirquent calculus, Part II
• Separating the basic logics of the basic recurrences
• The Computational Complexity of Propositional Cirquent Calculus
• Build your own clarithmetic I: Setup and completeness
• Ptarithmetic