On the Toggling-Branching Recurrence of Computability Logic

We introduce a new, substantially simplified version of the toggling-branching recurrence operation of com- putability logic, prove its equivalence to Japaridze＇s old, ＂canonical＂ version, and also prove that both versions preserve the static property of their arguments.

Saved in:
Bibliographic Details
Published inJournal of computer science and technology Vol. 28; no. 2; pp. 278 - 284
Main Author 曲美霞 栾峻峰 朱大铭 杜猛
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.03.2013
Springer Nature B.V
School of Mechanical, Electrical and Information Engineering, Shandong University at Weihai, Weihai 264209, China%School of Computer Science and Technology, Shandong University, Jinan 250101, China%School of Mechanical, Electrical and Information Engineering, Shandong University at Weihai, Weihai 264209, China
School of Computer Science and Technology, Shandong University, Jinan 250101, China
Subjects
Analysis
Artificial Intelligence
COM
Computation
Computer Science
Data Structures and Information Theory
Game theory
Information Systems Applications (incl.Internet)
Interactive computer systems
Logic
Regular Paper
Semantics
Software Engineering
Studies
Theory of Computation
可计算性
复发
版本
逻辑切换
逻辑证明
静态
game semantics
computability logic
interactive computation
static game
Online AccessGet full text
ISSN1000-9000
1860-4749
DOI10.1007/s11390-013-1329-1

Cover

More Information
Summary:We introduce a new, substantially simplified version of the toggling-branching recurrence operation of com- putability logic, prove its equivalence to Japaridze＇s old, ＂canonical＂ version, and also prove that both versions preserve the static property of their arguments.
Bibliography:We introduce a new, substantially simplified version of the toggling-branching recurrence operation of com- putability logic, prove its equivalence to Japaridze＇s old, ＂canonical＂ version, and also prove that both versions preserve the static property of their arguments.
11-2296/TP
computability logic, game semantics, interactive computation, static game
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-013-1329-1