The taming of recurrences in computability logic through cirquent calculus, Part II
Logic in Computer Science
2013-02-05 v1 Logic
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.
Keywords
Cite
@article{arxiv.1106.3705,
title = {The taming of recurrences in computability logic through cirquent calculus, Part II},
author = {Giorgi Japaridze},
journal= {arXiv preprint arXiv:1106.3705},
year = {2013}
}