Computability Logic: A Formal Theory of Interaction
From MaRDI portal
Publication:4928705
DOI10.1007/3-540-34874-3_9zbMath1266.03046arXivcs/0404024OpenAlexW1484853361MaRDI 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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (13)
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 ⋮ On the toggling-branching recurrence of computability logic ⋮ Build your own clarithmetic I: Setup and completeness ⋮ Introduction to clarithmetic. I ⋮ Verifying of interface assertions for infinite state Mealy machines ⋮ Towards applied theories based on computability logic ⋮ From truth to computability. I. ⋮ Sequential operators in computability logic ⋮ Many concepts and two logics of algorithmic reduction ⋮ Computability and realizability for interactive computations
This page was built for publication: Computability Logic: A Formal Theory of Interaction
