In the beginning was game semantics

Abstract

This article presents an overview of computability logic -- the game-semantically constructed logic of interactive computational tasks and resources. There is only one non-overview, technical section in it, devoted to a proof of the soundness of affine logic with respect to the semantics of computability logic. A comprehensive online source on the subject can be found at http://www.cis.upenn.edu/~giorgi/cl.html

To appear in: "Games: Unifying Logic, Language and Philosophy". O. Majer, A.-V. Pietarinen and T. Tulenheimo, eds. Springer Verlag, Berlin

References in corpus (11)

• Sequential operators in computability logic
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Propositional computability logic I
• Cirquent calculus deepened
• Computability Logic: a formal theory of interaction
• From truth to computability I
• The intuitionistic fragment of computability logic at the propositional level
• Propositional Computability Logic II
• Many concepts and two logics of algorithmic reduction
• From truth to computability II
• The logic of interactive Turing reduction

Cited by in corpus (6)

• Many concepts and two logics of algorithmic reduction
• The taming of recurrences in computability logic through cirquent calculus, Part I
• From formulas to cirquents in computability logic
• Towards applied theories based on computability logic
• The parallel versus branching recurrences in computability logic
• A new face of the branching recurrence of computability logic