Introduction to computability logic

DOI10.1016/S0168-0072(03)00023-XzbMath1028.03025WikidataQ56765032 ScholiaQ56765032MaRDI QIDQ1408853

Giorgi Japaridze

Publication date: 25 September 2003

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

linear logicTuring machineintuitionistic logicclassical logicgame semanticscomputability logicinteractive computation

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

The intuitionistic fragment of computability logic at the propositional level, From truth to computability. II., A cirquent calculus system with clustering and ranking, Cirquent Calculus in a Nutshell, Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism, Imperative programs as proofs via game semantics, The parallel versus branching recurrences in computability logic, 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, Enumerating Independent Linear Inferences, Aristotle on Universal Quantification: A Study from the Point of View of Game Semantics, 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, Information-gain computation in the \textsc{Fifth} system, A PSPACE-complete first-order fragment of computability logic, Towards applied theories based on computability logic, The scope of Gödel's first incompleteness theorem, On abstract resource semantics and computability logic, A new face of the branching recurrence of computability logic, From truth to computability. I., Sequential operators in computability logic, Propositional games with explicit strategies, Dialogue games for many-valued logics -- an overview, Many concepts and two logics of algorithmic reduction, A game-semantic model of computation, Introduction to clarithmetic. II

Cites Work

• Linear logic
• A game semantics for linear logic
• A constructive game semantics for the language of linear logic
• The propositional logic of elementary tasks
• Explicit Provability and Constructive Semantics
• Games in Dynamic-Epistemic Logic
• Alternation
• Games and full completeness for multiplicative linear logic
• Degrees of indeterminacy of games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item