From truth to computability. II.

DOI10.1016/j.tcs.2007.01.004zbMath1118.03021arXivcs/0501031OpenAlexW4213193997WikidataQ56768693 ScholiaQ56768693MaRDI QIDQ2373705

Giorgi Japaridze

Publication date: 16 July 2007

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

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

zbMATH Keywords

linear logicconstructive logicgame semanticscomputability logicinteractive computation

Mathematics Subject Classification ID

Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) 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

The intuitionistic fragment of computability logic at the propositional level, 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

• A game semantics for linear logic
• Introduction to computability logic
• From truth to computability. I.
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• In the beginning was game semantics
• Computability Logic: A Formal Theory of Interaction
• Propositional computability logic I
• Propositional computability logic II