Computability Logic: A Formal Theory of Interaction
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.
KeywordsFormal Theory Turing Machine Classical Logic Legal Move Static Game
Unable to display preview. Download preview PDF.
- 1.J. van Benthem. Logic in Games. Lecture Notes, Institute for Logic, Language and Computation (ILLC), University of Amsterdam, 2001.Google Scholar
- 7.G. Japaridze. Propositional computability logic I–II. ACM Transactions on Computational Logic 7:202–262, 2006.Google Scholar
- 9.G. Japaridze. From truth to computability II. http://arxiv.org/abs/cs.LO/0501031, 2005.Google Scholar
- 10.G. Japaridze. Intuitionistic computability logic. Acta Cybernetica (to appear).Google Scholar
- 11.K. Konolige. On the relation between default and autoepistemic logic. In: Proceedings of the International Joint Conference on Artificial Intelligence. Detroit, MI, 1989.Google Scholar
- 13.R. Moore. A formal theory of knowledge and action. In: Hobbs J, Moore R (eds.) Formal Theories of Commonsense Worlds. Ablex, Norwood, N.J., 1985.Google Scholar
- 14.M. Sipser. Introduction to the Theory of Computation, 2nd Edition. Thomson Course Technology, Boston, MA, 2006.Google Scholar