Generalizing the traditional concepts of predicates and their truth to interactive computational problems and their effective solvability, computability logic conservatively extends classical logic to a formal theory that provides a systematic answer to the question of what and how can be computed, just as traditional logic is a systematic tool for telling what is true. The present chapter contains a comprehensive yet relatively compact overview of this very recently introduced framework and research program. It is written in a semitutorial style with general computer science, logic and mathematics audiences in mind. © 2006 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Japaridze, G. (2006). Computability logic: A formal theory of interaction. In Interactive Computation: The New Paradigm (pp. 183–223). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-34874-3_9
Mendeley helps you to discover research relevant for your work.