We use cookies to improve your experience with our site.

Indexed in:

SCIE, Ei, Scopus, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Mei-Xia Qu, Jun-Feng Luan, Da-Ming Zhu, Meng Du. On the Toggling-Branching Recurrence of Computability Logic[J]. Journal of Computer Science and Technology, 2013, 28(2): 278-284. DOI: 10.1007/s11390-013-1329-1
Citation: Mei-Xia Qu, Jun-Feng Luan, Da-Ming Zhu, Meng Du. On the Toggling-Branching Recurrence of Computability Logic[J]. Journal of Computer Science and Technology, 2013, 28(2): 278-284. DOI: 10.1007/s11390-013-1329-1

On the Toggling-Branching Recurrence of Computability Logic

Funds: This work was supported by the National Natural Science Foundation of China under Grant No. 61070019 and the Natural Science Foundation of Shandong Province of China under Grant No. ZR2010FM032.
More Information
  • Received Date: July 03, 2012
  • Revised Date: December 10, 2012
  • Published Date: March 04, 2013
  • 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.
  • [1]
    Japaridze G. Introduction to computability logic. Annals ofPure and Applied Logic, 2003, 123(1/3): 1-99.
    [2]
    Bauer M S. A PSPACE-complete first order fragment of com-putability logic. http://arxiv.org/abs/1201.4856, Jan. 2012.
    [3]
    Japaridze G. Computability logic: A formal theory of inter-action. 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, Pietari-nen A V, Tulenheimo T (eds.), Springer, 2009, pp.249-350.
    [5]
    Japaridze G. Many concepts and two logics of algorithmicreduction. Studia Logica, 2009, 91(1): 1-24.
    [6]
    Japaridze G. Toggling operators in computability logic. The-oretical Computer Science, 2011, 412(11): 971-1004.
    [7]
    Japaridze G. A new face of the branching recurrence of com-putability logic. Applied Mathematics Letters, 2012, 25(11):1585-1589.
    [8]
    Japaridze G. The taming of recurrences in computability logicthrough cirquent calculus, Part I. Archive for MathematicalLogic, 2013, 52(1/2): 173-212.
    [9]
    Japaridze G. The taming of recurrences in computability logicthrough cirquent calculus, Part II. Archive for MathematicalLogic, 2013, 52(1/2): 213-259.
    [10]
    Kwon K, Hur S. Adding sequential conjunctions to Prolog. J.Compu. Tech. and Applicat., 2010, 1(1): 1-3.
    [11]
    Mezhirov I, Vereshchagin N. On abstract resource semanticsand computability logic. Journal of Computer and SystemSciences, 2010, 76(5): 356-372.
    [12]
    Xu W Y, Liu S Y. The countable versus uncountable branch-ing recurrences in computability logic. Journal of AppliedLogic, 2012, 10(4): 431-446.
    [13]
    Xu W Y, Liu S Y. The parallel versus branching recurrencesin computability logic. Notre Dame Journal of Formal Logic,2013, 54(1): 61-78.
  • Related Articles

    [1]Tong Ding, Ning Liu, Zhong-Min Yan, Lei Liu, Li-Zhen Cui. An Efficient Reinforcement Learning Game Framework for UAV-Enabled Wireless Sensor Network Data Collection[J]. Journal of Computer Science and Technology, 2022, 37(6): 1356-1368. DOI: 10.1007/s11390-022-2419-8
    [2]Xiao-Bing Chen, Hao Qi, Shao-Hui Peng, Yi-Min Zhuang, Tian Zhi, Yun-Ji Chen. Tetris: A Heuristic Static Memory Management Framework for Uniform Memory Multicore Neural Network Accelerators[J]. Journal of Computer Science and Technology, 2022, 37(6): 1255-1270. DOI: 10.1007/s11390-021-1213-3
    [3]En Wang, Han Wang, Peng-Min Dong, Yuan-Bo Xu, Yong-Jian Yang. Distributed Game-Theoretical D2D-Enabled Task Offloading in Mobile Edge Computing[J]. Journal of Computer Science and Technology, 2022, 37(4): 919-941. DOI: 10.1007/s11390-022-2063-3
    [4]Jiang Rong, Tao Qin, Bo An. Competitive Cloud Pricing for Long-Term Revenue Maximization[J]. Journal of Computer Science and Technology, 2019, 34(3): 645-656. DOI: 10.1007/s11390-019-1933-9
    [5]Lei Cui, Youyang Qu, Mohammad Reza Nosouhi, Shui Yu, Jian-Wei Niu, Gang Xie. Improving Data Utility Through Game Theory in Personalized Differential Privacy[J]. Journal of Computer Science and Technology, 2019, 34(2): 272-286. DOI: 10.1007/s11390-019-1910-3
    [6]Yang Liu, Guo-Fu Zhang, Zhao-Pin Su, Feng Yue, Jian-Guo Jiang. Using Computational Intelligence Algorithms to Solve the Coalition Structure Generation Problem in Coalitional Skill Games[J]. Journal of Computer Science and Technology, 2016, 31(6): 1136-1150. DOI: 10.1007/s11390-016-1688-5
    [7]Saiqa Aleem, Luiz Fernando Capretz, Faheem Ahmed. Critical Success Factors to Improve the Game Development Process from a Developer's Perspective[J]. Journal of Computer Science and Technology, 2016, 31(5): 925-950. DOI: 10.1007/s11390-016-1673-z
    [8]Yang Liu, Xuan-Dong Li, Yan Ma. A Game-Based Approach for PCTL* Stochastic Model Checking with Evidence[J]. Journal of Computer Science and Technology, 2016, 31(1): 198-216. DOI: 10.1007/s11390-016-1621-y
    [9]ZHANG WenHui. Combining Static Analysis and Case-Based Search Space Partitioning for Reducing Peak Memory in Model Checking[J]. Journal of Computer Science and Technology, 2003, 18(6).
    [10]wang Xuejun, Shi Chunyi. A Multiagent Dynamic interaction Testbed:Theoretic Framework, System Architecture and Experimentation[J]. Journal of Computer Science and Technology, 1997, 12(2): 121-132.

Catalog

    Article views (18) PDF downloads (1668) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return