Toggling operators in computability logic
From MaRDI portal
Publication:631756
DOI10.1016/j.tcs.2010.11.037zbMath1209.03024arXiv0904.3469MaRDI QIDQ631756
Publication date: 14 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0904.3469
axiomatization; game semantics; computability logic; interactive computation; constructive logics; resource logics
91A80: Applications of game theory
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03B70: Logic in computer science
Related Items
Separating the basic logics of the basic recurrences, Introduction to clarithmetic. I, A new face of the branching recurrence of computability logic, The taming of recurrences in computability logic through cirquent calculus. II, The taming of recurrences in computability logic through cirquent calculus. I, On the toggling-branching recurrence of computability logic, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, Build your own clarithmetic I: Setup and completeness
Cites Work
- Unnamed Item
- On abstract resource semantics and computability logic
- Sequential operators in computability logic
- Many concepts and two logics of algorithmic reduction
- A game semantics for linear logic
- Introduction to computability logic
- Zur Deutung der intuitionistischen Logik
- The intuitionistic fragment of computability logic at the propositional level
- From truth to computability. II.
- From truth to computability. I.
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- The logic of interactive turing reduction
- Cirquent Calculus Deepened
- Towards applied theories based on computability logic
- In the beginning was game semantics
- Computability Logic: A Formal Theory of Interaction
- Propositional computability logic I
- Propositional computability logic II
- Intuitionistic computability logic
- Degrees of indeterminacy of games
