Propositional computability logic I
From MaRDI portal
Publication:5277750
DOI10.1145/1131313.1131318zbMath1367.03056arXivcs/0404023WikidataQ56565659 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
91A80: Applications of game theory
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03B70: Logic in computer science
03F52: Proof-theoretic aspects of linear logic and other substructural logics
Related Items
Supervenience, Dependence, Disjunction, A PSPACE-complete first-order fragment of computability logic, Separating the basic logics of the basic recurrences, Toggling operators in computability logic, Introduction to clarithmetic. I, A new face of the branching recurrence of computability logic, Sequential operators in computability logic, The intuitionistic fragment of computability logic at the propositional level, From truth to computability. II., From truth to computability. I., Build your own clarithmetic I: Setup and completeness, Towards applied theories based on computability logic