| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662336 | Annals of Pure and Applied Logic | 2012 | 13 Pages |
Abstract
This paper shows that, even at the most basic level (namely, in combination with only ¬,∧,∨), the parallel, countable branching and uncountable branching recurrences of computability logic validate different principles.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
