On abstract resource semantics and computability logic

DOI10.1016/J.JCSS.2009.10.008zbMath1202.03041OpenAlexW2072873942MaRDI QIDQ980944

Ilya Mezhirov, Nikolai K. Vereshchagin

Publication date: 8 July 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.10.008

zbMATH Keywords

linear logicgame semanticscomputability logicabstract resource semanticslogic of taskspositive fragment of intuitionistic logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (9)

The parallel versus branching recurrences in computability logic ⋮ The taming of recurrences in computability logic through cirquent calculus. I ⋮ Separating the basic logics of the basic recurrences ⋮ Toggling operators in computability logic ⋮ The countable versus uncountable branching recurrences in computability logic ⋮ On the toggling-branching recurrence of computability logic ⋮ Build your own clarithmetic I: Setup and completeness ⋮ Introduction to clarithmetic. I ⋮ A new face of the branching recurrence of computability logic

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• Sequential operators in computability logic
• Many concepts and two logics of algorithmic reduction
• A game semantics for linear logic
• Introduction to computability logic
• The intuitionistic fragment of computability logic at the propositional level
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• On Game Semantics of the Affine and Intuitionistic Logics
• In the beginning was game semantics
• Propositional computability logic II
• Degrees of indeterminacy of games
• Propositional Calculus and Realizability

This page was built for publication: On abstract resource semantics and computability logic