The taming of recurrences in computability logic through cirquent calculus, Part II

Details The taming of recurrences in computability logic through cirquent calculus, Part II The taming of recurrences in computability logic through cirquent calculus, Part II

2011-06-19

arxiv.org/abs/1106.3705v1

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The taming of recurrences in computability logic through cirquent calculus, Part II does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The taming of recurrences in computability logic through cirquent calculus, Part II, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The taming of recurrences in computability logic through cirquent calculus, Part II will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-723057