A new face of the branching recurrence of computability logic

DOI10.1016/j.aml.2011.11.023zbMath1259.03045arXiv1102.1054OpenAlexW1818426358MaRDI QIDQ712555

Giorgi Japaridze

Publication date: 17 October 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

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

zbMATH Keywords

game semanticscomputability logicinteractive computationresource semanticsbranching recurrence operation

Mathematics Subject Classification ID

Applications of game theory (91A80) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (5)

The parallel versus branching recurrences in computability logic ⋮ The taming of recurrences in computability logic through cirquent calculus. I ⋮ The countable versus uncountable branching recurrences in computability logic ⋮ On the toggling-branching recurrence of computability logic ⋮ Build your own clarithmetic I: Setup and completeness

Cites Work

• Linear logic
• Toggling operators in computability logic
• On abstract resource semantics and computability logic
• Sequential operators in computability logic
• A game semantics for linear logic
• Introduction to computability logic
• The intuitionistic fragment of computability logic at the propositional level
• From truth to computability. II.
• From truth to computability. I.
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• The logic of interactive turing reduction
• Cirquent Calculus Deepened
• Towards applied theories based on computability logic
• In the beginning was game semantics
• Propositional computability logic I
• Propositional computability logic II

This page was built for publication: A new face of the branching recurrence of computability logic