A new face of the branching recurrence of computability logic
Logic in Computer Science
2012-08-03 v2 Logic
Abstract
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.
Cite
@article{arxiv.1102.1054,
title = {A new face of the branching recurrence of computability logic},
author = {Giorgi Japaridze},
journal= {arXiv preprint arXiv:1102.1054},
year = {2012}
}