Separating the basic logics of the basic recurrences

DOI10.1016/J.APAL.2011.11.009MaRDI QIDQ409329zbMATH OpenOpenAlexFDO

Authors Giorgi Japaridze

Publication date 13 April 2012

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

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

zbMATH Keywords

computability logicgame semanticsrecurrence operators

Mathematics Subject Classification ID

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

Abstract: This paper shows that, even at the most basic level, the parallel, countable branching and uncountable branching recurrences of Computability Logic (see http://www.cis.upenn.edu/~giorgi/cl.html) validate different principles.

Recommendations

• The parallel versus branching recurrences in computability logic
• The countable versus uncountable branching recurrences in computability logic
• On the toggling-branching recurrence of computability logic
• The taming of recurrences in computability logic through cirquent calculus. I
• The taming of recurrences in computability logic through cirquent calculus. II

Cites work

• A game semantics for linear logic
• Cirquent Calculus Deepened
• Computability logic: a formal theory of interaction
• Degrees of indeterminacy of games
• From truth to computability. I.
• From truth to computability. II.
• In the beginning was game semantics
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Introduction to computability logic
• Many concepts and two logics of algorithmic reduction
• On abstract resource semantics and computability logic
• Propositional computability logic I
• Propositional computability logic II
• Sequential operators in computability logic
• The intuitionistic fragment of computability logic at the propositional level
• The logic of interactive turing reduction
• Toggling operators in computability logic
• Towards applied theories based on computability logic

Cited in

(6)

• The parallel versus branching recurrences in computability logic
• The taming of recurrences in computability logic through cirquent calculus. I
• 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
• A propositional cirquent calculus for computability logic.

This page was built for publication: Separating the basic logics of the basic recurrences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409329)