From truth to computability. II.

DOI10.1016/j.tcs.2007.01.004zbMath1118.03021arXivcs/0501031WikidataQ56768693 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 logic; constructive logic; game semantics; computability logic; interactive computation

Mathematics Subject Classification ID

91A80: Applications of game theory

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

03B70: Logic in computer science

03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)

03F52: Proof-theoretic aspects of linear logic and other substructural logics

03F50: Metamathematics of constructive systems

Related Items

A PSPACE-complete first-order fragment of computability logic, Separating the basic logics of the basic recurrences, Toggling operators in computability logic, Introduction to clarithmetic. I, A new face of the branching recurrence of computability logic, Sequential operators in computability logic, Many concepts and two logics of algorithmic reduction, The taming of recurrences in computability logic through cirquent calculus. II, The taming of recurrences in computability logic through cirquent calculus. I, The intuitionistic fragment of computability logic at the propositional level, Build your own clarithmetic I: Setup and completeness, Towards applied theories based on computability logic

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