On the Toggling-Branching Recurrence of Computability Logic-Reference-Cited by-同舟云学术

On the Toggling-Branching Recurrence of Computability Logic

Published:2013-03 Issue:2 Volume:28 Page:278-284
ISSN:1000-9000
Container-title:Journal of Computer Science and Technology
language:en
Short-container-title:J. Comput. Sci. Technol.

Author:

Qu Mei-Xia,Luan Jun-Feng,Zhu Da-Ming,Du Meng

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s11390-013-1329-1.pdf

Reference13 articles.

1. Japaridze G (2003) Introduction to computability logic. Annals of Pure and Applied Logic 123(1/3):1–99

2. Bauer M S. A PSPACE-complete first order fragment of computability logic. http://arxiv.org/abs/1201.4856 , Jan. 2012.

3. 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.

4. 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.

5. Japaridze G (2009) Many concepts and two logics of algorithmic reduction. Studia Logica 91(1):1–24

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Build your own clarithmetic I: Setup and completeness;Logical Methods in Computer Science;2017-04-27

2. On the system CL12 of computability logic;Logical Methods in Computer Science;2015-07-28

3. THE COMPUTATIONAL COMPLEXITY OF PROPOSITIONAL CIRQUENT CALCULUS;LOG METH COMPUT SCI;2015