The countable versus uncountable branching recurrences in computability logic

This paper introduces a new simplified version of the countable branching recurrence (sic)N-0 of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by (sic)N-0 (i.e., the one in the signature {(sic)N-0, boolean AND, boolean OR, (sic)N-0)) is a proper superset of the basic logic induced by the uncountable branching recurrence (sic) (i.e., the one in the signature {(sic)N-0, boolean AND, boolean OR, (sic)}) further result of this paper is showing that (sic)N-0 is strictly weaker than (sic) in the sense that (sic)F logically implies but not vice versa. (C) 2012 Published by Elsevier BA/.