The parallel versus branching recurrences in computability logic

Details The parallel versus branching recurrences in computability logic The parallel versus branching recurrences in computability logic

2011-07-12

arxiv.org/abs/1107.2284v1

Computer Science

Logic in Computer Science

14 pages

Scientific paper

This paper shows that the basic logic induced by the parallel recurrence of Computability Logic is a proper superset of the basic logic induced by the branching recurrence. The latter is known to be precisely captured by the cirquent calculus system CL15, conjectured by Japaridze to remain sound---but not complete---with parallel recurrence instead of branching recurrence. The present result is obtained by positively verifying that conjecture. A secondary result of the paper is showing that parallel recurrence is strictly weaker than branching recurrence in the sense that, while the latter logically implies the former, vice versa does not hold.

Affiliated with

Also associated with

No associations

Rating

The parallel versus branching recurrences in computability logic 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 parallel versus branching recurrences in computability logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The parallel versus branching recurrences in computability logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-565474