Separating the basic logics of the basic recurrences
Logic in Computer Science
2012-01-04 v3 Logic
Abstract
This paper shows that, even at the most basic level, the parallel, countable branching and uncountable branching recurrences of Computability Logic (see http://www.cis.upenn.edu/~giorgi/cl.html) validate different principles.
Cite
@article{arxiv.1007.1324,
title = {Separating the basic logics of the basic recurrences},
author = {Giorgi Japaridze},
journal= {arXiv preprint arXiv:1007.1324},
year = {2012}
}