Computability Logic: a formal theory of interaction

TL;DR

Computability logic is a formal framework that models interactive computation, akin to how classical logic models truth, and this paper presents a more accessible, concise introduction aimed at computer science, logic, and mathematics audiences.

Contribution

The paper reintroduces computability logic in a simplified, less technical manner, making the theory more accessible to a broader audience.

Findings

Provides a compact, tutorial-style overview of computability logic.

Clarifies the relationship between computability logic and classical logic.

Offers online resources for further exploration.

Abstract

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 .