On the toggling-branching recurrence of Computability Logic
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2012
- DOI:
- 10.48550/arXiv.1207.1188
- arXiv:
- arXiv:1207.1188
- Bibcode:
- 2012arXiv1207.1188Q
- Keywords:
-
- Computer Science - Logic in Computer Science