The countable versus uncountable branching recurrences in computability logic

Details The countable versus uncountable branching recurrences in computability logic The countable versus uncountable branching recurrences in computability logic

2011-07-19

arxiv.org/abs/1107.3706v1

Computer Science

Logic in Computer Science

20 pages

Scientific paper

This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by it is a proper superset of the basic logic induced by the uncountable branching recurrence. A further result of this paper is showing that the countable branching recurrence is strictly weaker than the uncountable branching recurrence in the sense that the latter logically implies the former but not vice versa.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-514532