Separating the basic logics of the basic recurrences

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.apal.2011.11.009

This paper shows that, even at the most basic level, the parallel, countable
branching and uncountable branching recurrences of Computability Logic (see
http://www.cis.upenn.edu/~giorgi/cl.html) validate different principles.

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

Separating the basic logics of the basic recurrences 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 Separating the basic logics of the basic recurrences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Separating the basic logics of the basic recurrences will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-102659

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