Computability Logic: a formal theory of interaction
Interactive Computation: The New Paradigm. D.Goldin, S.Smolka and P.Wegner, eds. Springer Verlag, Berlin 2006, pp. 183-223 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...
Saved in:
Main Author | |
---|---|
Format | Journal Article |
Language | English |
Published |
08.04.2004
|
Subjects | |
Online Access | Get full text |
DOI | 10.48550/arxiv.cs/0404024 |
Cover
Summary: | Interactive Computation: The New Paradigm. D.Goldin, S.Smolka and
P.Wegner, eds. Springer Verlag, Berlin 2006, pp. 183-223 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 . |
---|---|
DOI: | 10.48550/arxiv.cs/0404024 |