The taming of recurrences in computability logic through cirquent calculus. I

DOI10.1007/s00153-012-0313-8zbMath1298.03068arXiv1105.3853OpenAlexW2051877815MaRDI QIDQ1935369

Giorgi Japaridze

Publication date: 15 February 2013

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

game semanticscomputability logicinteractive computationresource semanticscirquent calculus

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items

A cirquent calculus system with clustering and ranking ⋮ Cirquent Calculus in a Nutshell ⋮ The parallel versus branching recurrences in computability logic ⋮ The taming of recurrences in computability logic through cirquent calculus. II ⋮ On the toggling-branching recurrence of computability logic ⋮ Build your own clarithmetic I: Setup and completeness

Cites Work

• Unnamed Item
• Introduction to clarithmetic. III
• Separating the basic logics of the basic recurrences
• Linear logic
• Toggling operators in computability logic
• Introduction to clarithmetic. I
• A new face of the branching recurrence of computability logic
• On abstract resource semantics and computability 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 taming of recurrences in computability logic through cirquent calculus. II
• The intuitionistic fragment of computability logic at the propositional level
• From truth to computability. II.
• From truth to computability. I.
• A logical basis for constructive systems
• Soundness and completeness of the Cirquent calculus system CL6 for computability logic
• From formulas to cirquents in computability logic
• Deduction Theorem for Symmetric Cirquent Calculus
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• The logic of interactive turing reduction
• Cirquent Calculus Deepened
• Towards applied theories based on computability logic
• A constructive analysis of RM
• Intuitionistic computability logic

This page was built for publication: The taming of recurrences in computability logic through cirquent calculus. I