A new face of the branching recurrence of computability logic

DOI10.1016/J.AML.2011.11.023MaRDI QIDQ712555zbMATH OpenOpenAlexFDO

Authors 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

computability logicgame semanticsinteractive 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)

Abstract: This letter introduces a new, substantially simplified version of the branching recurrence operation of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html), and proves its equivalence to the old, "canonical" version.

Recommendations

• On the toggling-branching recurrence of computability logic
• The parallel versus branching recurrences in computability logic
• The countable versus uncountable 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
• On the proof complexity of logics of bounded branching
• On the Complexity of Branching-Time Logics
• New complexity results for Łukasiewicz logic
• L-recursion and a new logic for logarithmic space
• L-recursion and a new logic for logarithmic space

Cites work

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

Cited in

(5)

• On the toggling-branching recurrence of computability logic
• 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
• Build your own clarithmetic. I: Setup and completeness

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

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