A new face of the branching recurrence of computability logic
  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. 
Giorgi Japaridze
cs.LO math.LO