Sequential operators in computability logic
From MaRDI portal
Publication:999265
DOI10.1016/J.IC.2008.10.001zbMath1161.03016arXiv0712.1345OpenAlexW1964882086WikidataQ56767143 ScholiaQ56767143MaRDI QIDQ999265
Publication date: 3 February 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.1345
Related Items (12)
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ The taming of recurrences in computability logic through cirquent calculus. II ⋮ The taming of recurrences in computability logic through cirquent calculus. I ⋮ 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 ⋮ Towards applied theories based on computability logic ⋮ On abstract resource semantics and computability logic ⋮ A new face of the branching recurrence of computability logic ⋮ Many concepts and two logics of algorithmic reduction ⋮ Non-commutative propositional logic with short-circuit evaluation
Cites Work
- 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
- In the beginning was game semantics
- Games and full completeness for multiplicative linear logic
- Computability Logic: A Formal Theory of Interaction
- Propositional computability logic I
- Propositional computability logic II
- Intuitionistic computability logic
- Degrees of indeterminacy of games
This page was built for publication: Sequential operators in computability logic
