Propositional computability logic I
From MaRDI portal
Publication:5277750
DOI10.1145/1131313.1131318zbMath1367.03056DBLPjournals/tocl/Japaridze06arXivcs/0404023OpenAlexW2121000477WikidataQ56565659 ScholiaQ56565659MaRDI QIDQ5277750
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/0404023
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 (12)
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 ⋮ A new face of the branching recurrence of computability logic ⋮ From truth to computability. I. ⋮ Sequential operators in computability logic ⋮ Supervenience, Dependence, Disjunction
This page was built for publication: Propositional computability logic I