A new face of the branching recurrence of computability logic

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.

References in corpus (12)

• Sequential operators in computability logic
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Propositional computability logic I
• Cirquent calculus deepened
• From truth to computability I
• The intuitionistic fragment of computability logic at the propositional level
• Propositional Computability Logic II
• From truth to computability II
• Toggling operators in computability logic
• The logic of interactive Turing reduction
• Towards applied theories based on computability logic
• In the beginning was game semantics

Cited by in corpus (7)

• The taming of recurrences in computability logic through cirquent calculus, Part I
• The parallel versus branching recurrences in computability logic
• On the system CL12 of computability logic
• Build your own clarithmetic I: Setup and completeness
• The countable versus uncountable branching recurrences in computability logic
• For-loops in Logic Programming
• On the toggling-branching recurrence of Computability Logic