A new face of the branching recurrence of computability logic

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1016/j.aml.2011.11.023

This letter introduces a new, substantially simplified version of the
branching recurrence operation of computability logic (see
http://www.cis.upenn.edu/~giorgi/cl.html), and proves its equivalence to the
old, "canonical" version.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A new face of the branching recurrence of 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 A new face of the branching recurrence of computability logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new face of the branching recurrence of computability logic will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-52596

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.