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 pap...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Giorgi Japaridze
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 10.12.2004
Subjects
HyperText Markup Language
Logic
Online AccessGet full text
ISSN2331-8422
DOI10.48550/arxiv.0404024

Cover

More Information
Summary: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 .
Bibliography:content type line 50
SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
ISSN:2331-8422
DOI:10.48550/arxiv.0404024