The parallel versus branching recurrences in computability logic

DOI10.1215/00294527-1731389zbMath1291.03072arXiv1107.2284OpenAlexW1975039231MaRDI QIDQ1934954

Wenyan Xu, San-Yang Liu

Publication date: 30 January 2013

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

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

zbMATH Keywords

game semanticscomputability logicinteractive computationresource semanticscirquent calculus

Mathematics Subject Classification ID

Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (3)

A cirquent calculus system with clustering and ranking ⋮ On the toggling-branching recurrence of computability logic ⋮ Build your own clarithmetic I: Setup and completeness

Cites Work

• Separating the basic logics of the basic recurrences
• A new face of the branching recurrence of computability logic
• On abstract resource semantics and computability logic
• Many concepts and two logics of algorithmic reduction
• Introduction to computability logic
• The taming of recurrences in computability logic through cirquent calculus. II
• The taming of recurrences in computability logic through cirquent calculus. I
• Soundness and completeness of the Cirquent calculus system CL6 for computability logic
• From formulas to cirquents in computability logic
• Deduction Theorem for Symmetric Cirquent Calculus
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• The logic of interactive turing reduction
• Cirquent Calculus Deepened
• In the beginning was game semantics

This page was built for publication: The parallel versus branching recurrences in computability logic