Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1708331 | Applied Mathematics Letters | 2012 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Giorgi Japaridze,