Computability Logic: a formal theory of interaction
<|reference_start|>Computability Logic: a formal theory of interaction: Computability logic is a formal theory of (interactive) computability in the same sense as classical logic is a formal theory of truth. This approach was initiated very recently in "Introduction to computability logic" (Annals of Pure and Applied Logic 123 (2003), pp.1-99). The present paper reintroduces computability logic in a more compact and less technical way. It is written in a semitutorial style with a general computer science, logic or mathematics audience in mind. An Internet source on the subject is available at http://www.cis.upenn.edu/~giorgi/cl.html, and additional material at http://www.csc.villanova.edu/~japaridz/CL/gsoll.html .<|reference_end|>
@article{japaridze2004computability,
    title={Computability Logic: a formal theory of interaction},
    author={Giorgi Japaridze},
    journal={Interactive Computation: The New Paradigm. D.Goldin, S.Smolka and
  P.Wegner, eds. Springer Verlag, Berlin 2006, pp. 183-223},
    year={2004},
    doi={10.1007/3-540-34874-3_9},
    archivePrefix={arXiv},
    eprint={cs/0404024},
    primaryClass={cs.LO cs.AI math.LO}
}