On the Toggling-Branching Recurrence of Computability Logic
We introduce a new, substantially simplified version of the toggling-branching recurrence operation of computability logic, prove its equivalence to Japaridze's old, "canonical" version, and also prove that both versions preserve the static property of their arguments.
computability logic game semantics interactive computation static game