Computability Logic: A Formal Theory of Interaction
From MaRDI portal
Publication:4928705
DOI10.1007/3-540-34874-3_9zbMath1266.03046arXivcs/0404024MaRDI QIDQ4928705
Publication date: 18 June 2013
Published in: Interactive Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0404024
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03B70: Logic in computer science
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Separating the basic logics of the basic recurrences, Toggling operators in computability logic, Introduction to clarithmetic. I, Sequential operators in computability logic, Many concepts and two logics of algorithmic reduction, Computability and realizability for interactive computations, The intuitionistic fragment of computability logic at the propositional level, From truth to computability. II., On the toggling-branching recurrence of computability logic, Verifying of interface assertions for infinite state Mealy machines, From truth to computability. I., Build your own clarithmetic I: Setup and completeness, Towards applied theories based on computability logic