In the beginning was game semantics

MaRDI QIDQ3620031zbMATH OpenFDO

Authors Giorgi Japaridze

Publication date 14 April 2009

Full work available at URL https://arxiv.org/abs/cs/0507045

zbMATH Keywords

affine logiccomputability logicconstructive logicsgame semanticsinteractive computationlinear logicsurvey paperwinnability

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Applications of game theory (91A80)

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

Recommendations

• From truth to computability. I.
• Introduction to computability logic
• Propositional computability logic I
• Computability logic: giving Caesar what belongs to Caesar
• Sequential operators in computability logic

Cited in

(19)

• Many concepts and two logics of algorithmic reduction
• The parallel versus branching recurrences in computability logic
• The countable versus uncountable branching recurrences in computability logic
• A game-semantic model of computation
• From truth to computability. II.
• On the toggling-branching recurrence of computability logic
• Introduction to clarithmetic. II
• Build your own clarithmetic. I: Setup and completeness
• A cirquent calculus system with clustering and ranking
• Separating the basic logics of the basic recurrences
• scientific article; zbMATH DE number 1508925 (Why is no real title available?)
• Supervenience, dependence, disjunction
• A PSPACE-complete first-order fragment of computability logic
• Toggling operators in computability logic
• Introduction to clarithmetic. I
• A propositional cirquent calculus for computability logic.
• A new face of the branching recurrence of computability logic
• On abstract resource semantics and computability logic
• Sequential operators in computability logic

This page was built for publication: In the beginning was game semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3620031)