Summary
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.
This material is based upon work supported by the National Science Foundation under Grant No. 0208816
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. van Benthem. Logic in Games. Lecture Notes, Institute for Logic, Language and Computation (ILLC), University of Amsterdam, 2001.
A. Blass. A game semantics for linear logic. Ann Pure Appl Logic 56:183–220, 1992.
J. Girard. Linear logic. Theoret Comp Sci 50:1–102, 1987.
D. Goldin. Persistent Turing machines as a model of interactive computation. Lecture Notes in Comp Sci 1762:116–135, 2000.
D. Goldin, S. Smolka, P. Attie, E. Sonderegger. Turing machines, transition systems and interaction. Information and Computation 194:101–128, 2004.
G. Japaridze. Introduction to computability logic. Ann Pure Appl Logic 123:1–99, 2003.
G. Japaridze. Propositional computability logic I–II. ACM Transactions on Computational Logic 7:202–262, 2006.
G. Japaridze. From truth to computability I. Theoret Comp Sci 357:100–135, 2006.
G. Japaridze. From truth to computability II. http://arxiv.org/abs/cs.LO/0501031, 2005.
G. Japaridze. Intuitionistic computability logic. Acta Cybernetica (to appear).
K. Konolige. On the relation between default and autoepistemic logic. In: Proceedings of the International Joint Conference on Artificial Intelligence. Detroit, MI, 1989.
R. Milner. Elements of interaction. Communications of the ACM 36:79–89, 1993.
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.
M. Sipser. Introduction to the Theory of Computation, 2nd Edition. Thomson Course Technology, Boston, MA, 2006.
A. Turing. On Computable numbers with an application to the entsheidungsproblem. Proc London Math Soc 2.42:230–265, 1936.
P. Wegner. Interactive foundations of computing. Theoret Comp Sci 192:315–351, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Japaridze, G. (2006). Computability Logic: A Formal Theory of Interaction. In: Goldin, D., Smolka, S.A., Wegner, P. (eds) Interactive Computation. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-34874-3_9
Download citation
DOI: https://doi.org/10.1007/3-540-34874-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34666-1
Online ISBN: 978-3-540-34874-0
eBook Packages: Computer ScienceComputer Science (R0)