In the beginning was game semantics

2005/07/31 by Giorgi Japaridze · 2 citations
Computer Science · Mathematics · #Computability, Logic, AI Algorithms #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.AI #cs.LO #math.LO

paper · pdf · doi:10.1007/978-1-4020-9374-6_11

published as Games: Unifying Logic, Language and Philosophy. O. Majer, A.-V. Pietarinen and T. Tulenheimo, eds. Springer 2009, pp. 249-350 · To appear in: "Games: Unifying Logic, Language and Philosophy". O. Majer, A.-V. Pietarinen and T. Tulenheimo, eds. Springer Verlag, Berlin

arxiv created 2008/10/24 · openalex publication_date 2009/01/15 · crossref created 2009/01/15 · arxiv updated 2011/04/15 · openalex created_date 2016/06/24 · crossref deposited 2021/04/29 · crossref indexed 2026/04/30 · openalex updated_date 2026/08/04

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

Citations

• Introduction to Cirquent Calculus and Abstract Resource Semantics
• The intuitionistic fragment of computability logic at the propositional level
• Introduction to computability logic
• Turing machines, transition systems, and interaction
• Linear logic

Cited by

• The taming of recurrences in computability logic through cirquent calculus, Part I
• Computability logic [wikipedia]