Propositional computability logic II

DOI10.1145/1131313.1131319zbMath1367.03057arXivcs/0406037OpenAlexW4253236060WikidataQ56565714 ScholiaQ56565714MaRDI QIDQ5277751

Giorgi Japaridze

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

linear logicgame semanticscomputability logiccomputational resourcesinteractive algorithms

Mathematics Subject Classification ID

Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

The intuitionistic fragment of computability logic at the propositional level ⋮ From truth to computability. II. ⋮ Separating the basic logics of the basic recurrences ⋮ Toggling operators in computability logic ⋮ Build your own clarithmetic I: Setup and completeness ⋮ Introduction to clarithmetic. I ⋮ A PSPACE-complete first-order fragment of computability logic ⋮ Towards applied theories based on computability logic ⋮ On abstract resource semantics and computability logic ⋮ A new face of the branching recurrence of computability logic ⋮ Sequential operators in computability logic

This page was built for publication: Propositional computability logic II