Article ID Journal Published Year Pages File Type
1708331 Applied Mathematics Letters 2012 5 Pages PDF
Abstract
This letter introduces a new, substantially simplified version of the branching recurrence operation of computability logic, and proves its equivalence to the old, “canonical” version.
Keywords
Related Topics
Physical Sciences and Engineering Engineering Computational Mechanics
Preview
A new face of the branching recurrence of computability logic
Authors
,