Skip to main content
SpringerLink
Log in

On the Toggling-Branching Recurrence of Computability Logic

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  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

    Article  MathSciNet  MATH  Google Scholar 

  6. Japaridze G (2011) Toggling operators in computability logic. Theoretical Computer Science 412(11):971–1004

    Article  MathSciNet  MATH  Google Scholar 

  7. Japaridze G (2012) A new face of the branching recurrence of computability logic. Applied Mathematics Letters 25(11):1585–1589

    Article  MathSciNet  MATH  Google Scholar 

  8. Japaridze G (2013) The taming of recurrences in computability logic through cirquent calculus, Part I. Archive for Mathematical Logic 52(1/2):173–212

    Article  MathSciNet  MATH  Google Scholar 

  9. Japaridze G (2013) The taming of recurrences in computability logic through cirquent calculus, Part II. Archive for Mathematical Logic 52(1/2):213–259

    Article  MathSciNet  MATH  Google Scholar 

  10. Kwon K, Hur S (2010) Adding sequential conjunctions to Prolog. J Compu Tech and Applicat 1(1):1–3

    Google Scholar 

  11. Mezhirov I, Vereshchagin N (2010) On abstract resource semantics and computability logic. Journal of Computer and System Sciences 76(5):356–372

    Article  MathSciNet  MATH  Google Scholar 

  12. Xu WY, Liu SY (2012) The countable versus uncountable branching recurrences in computability logic. Journal of Applied Logic 10(4):431–446

    Article  MathSciNet  Google Scholar 

  13. Xu WY, Liu SY (2013) The parallel versus branching recurrences in computability logic. Notre Dame Journal of Formal Logic 54(1):61–78

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Shandong University, Jinan, 250101, China

    Mei-Xia Qu, Jun-Feng Luan & Da-Ming Zhu

  2. School of Mechanical, Electrical and Information Engineering, Shandong University at Weihai, Weihai, 264209, China

    Mei-Xia Qu & Meng Du

Authors
  1. Mei-Xia Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun-Feng Luan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Da-Ming Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Meng Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Da-Ming Zhu.

Additional information

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.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(DOC 26.5 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qu, MX., Luan, JF., Zhu, DM. et al. On the Toggling-Branching Recurrence of Computability Logic. J. Comput. Sci. Technol. 28, 278–284 (2013). https://doi.org/10.1007/s11390-013-1329-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-013-1329-1

Keywords

Search

Navigation