From truth to computability. I.

DOI10.1016/J.TCS.2006.03.014zbMath1094.03019DBLPjournals/tcs/Japaridze06arXivcs/0407054OpenAlexW1985872645WikidataQ56768690 ScholiaQ56768690MaRDI QIDQ2500484

Giorgi Japaridze

Publication date: 16 August 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0407054

zbMATH Keywords

linear logicgame semanticscomputability logicinteractive computationknowledge basesconstructive logics

Mathematics Subject Classification ID

2-person games (91A05) Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic in computer science (03B70) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Metamathematics of constructive systems (03F50)

Related Items (13)

The intuitionistic fragment of computability logic at the propositional level ⋮ From truth to computability. II. ⋮ 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 ⋮ A PSPACE-complete first-order fragment of computability logic ⋮ Towards applied theories based on computability logic ⋮ A new face of the branching recurrence of computability logic ⋮ Sequential operators in computability logic ⋮ Many concepts and two logics of algorithmic reduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• A game semantics for linear logic
• A constructive game semantics for the language of linear logic
• Introduction to computability logic
• The propositional logic of elementary tasks
• Games in Dynamic-Epistemic Logic
• Games and full completeness for multiplicative linear logic
• Computability Logic: A Formal Theory of Interaction
• Propositional computability logic I

This page was built for publication: From truth to computability. I.