The taming of recurrences in computability logic through cirquent calculus, Part II
arXiv:1106.3705 · doi:10.1007/s00153-012-0314-7
Abstract
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of negation, parallel conjunction, parallel disjunction, branching recurrence, and branching corecurrence. The article is published in two parts, with (the previous) Part I containing preliminaries and a soundness proof, and (the present) Part II containing a completeness proof.
References in corpus (10)
- Sequential operators in computability logic
- Propositional computability logic I
- From truth to computability I
- The intuitionistic fragment of computability logic at the propositional level
- Propositional Computability Logic II
- From truth to computability II
- The taming of recurrences in computability logic through cirquent calculus, Part I
- The logic of interactive Turing reduction
- Toggling operators in computability logic
- A logical basis for constructive systems