In the beginning was game semantics
From MaRDI portal
Publication:3620031
zbMath1171.03015arXivcs/0507045MaRDI QIDQ3620031
Publication date: 14 April 2009
Full work available at URL: https://arxiv.org/abs/cs/0507045
linear logicsurvey papergame semanticscomputability logicinteractive computationconstructive logicsaffine logicwinnability
Applications of game theory (91A80) Other nonclassical logic (03B60) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items
From truth to computability. II. ⋮ A cirquent calculus system with clustering and ranking ⋮ The parallel versus branching recurrences in computability logic ⋮ Separating the basic logics of the basic recurrences ⋮ Toggling operators in computability logic ⋮ The countable versus uncountable branching recurrences in computability logic ⋮ On the toggling-branching recurrence of computability logic ⋮ Build your own clarithmetic I: Setup and completeness ⋮ Introduction to clarithmetic. I ⋮ A PSPACE-complete first-order fragment of computability logic ⋮ On abstract resource semantics and computability logic ⋮ A new face of the branching recurrence of computability logic ⋮ Sequential operators in computability logic ⋮ Many concepts and two logics of algorithmic reduction ⋮ Supervenience, Dependence, Disjunction ⋮ Introduction to clarithmetic. II
This page was built for publication: In the beginning was game semantics
