On the toggling-branching recurrence of computability logic

DOI10.1007/S11390-013-1329-1zbMATH Open1280.03038arXiv1207.1188OpenAlexW2047203570MaRDI QIDQ2434574FDOQ2434574

Authors: Mei-Xia Qu, Junfeng Luan, Daming Zhu, Meng Du 

Publication date: 6 February 2014

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1207.1188

Recommendations

• Toggling operators in computability logic
• The parallel versus branching recurrences in computability logic
• The countable versus uncountable branching recurrences in computability logic
• Separating the basic logics of the basic recurrences
• The taming of recurrences in computability logic through cirquent calculus. I

zbMATH Keywords

computability logicgame semanticsinteractive computationstatic game

Mathematics Subject Classification ID

Applications of game theory (91A80) Logic in computer science (03B70)

Cites Work

• Introduction to computability logic
• In the beginning was game semantics
• The parallel versus branching recurrences in computability logic
• The taming of recurrences in computability logic through cirquent calculus. II
• The taming of recurrences in computability logic through cirquent calculus. I
• The countable versus uncountable branching recurrences in computability logic
• Many concepts and two logics of algorithmic reduction
• Computability Logic: A Formal Theory of Interaction
• Toggling operators in computability logic
• On abstract resource semantics and computability logic
• A new face of the branching recurrence of computability logic
• A PSPACE-complete first-order fragment of computability logic

Cited In (5)

• Separating the basic logics of the basic recurrences
• Toggling operators in computability logic
• A new face of the branching recurrence of computability logic
• Build your own clarithmetic I: Setup and completeness
• A propositional cirquent calculus for computability logic.

This page was built for publication: On the toggling-branching recurrence of computability logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434574)