On the Toggling-Branching Recurrence of Computability Logic
- 65 Downloads
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.
Keywordscomputability logic game semantics interactive computation static game
Unable to display preview. Download preview PDF.
- Bauer M S. A PSPACE-complete first order fragment of computability logic. http://arxiv.org/abs/1201.4856, Jan. 2012.
- Japaridze G. Computability logic: A formal theory of interaction. In Interactive Computation: The New Paradigm, Goldin D, Smolka S A, Wegner P (eds.), Springer, 2006, pp.183–223.Google Scholar
- Japaridze G. In the beginning was game semantics. In Games: Unifying Logic, Language, and Philosophy, Majer O, Pietarinen A V, Tulenheimo T (eds.), Springer, 2009, pp.249–350.Google Scholar
- Kwon K, Hur S (2010) Adding sequential conjunctions to Prolog. J Compu Tech and Applicat 1(1):1–3Google Scholar