Separating the basic logics of the basic recurrences

DOI10.1016/J.APAL.2011.11.009zbMATH Open1241.03025arXiv1007.1324OpenAlexW1534695534MaRDI QIDQ409329FDOQ409329

Authors: Giorgi Japaridze 

Publication date: 13 April 2012

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

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.

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

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

zbMATH Keywords

computability logicgame semanticsrecurrence operators

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• On the toggling-branching recurrence of computability logic
• Build your own clarithmetic. I: Setup and completeness
• 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
• 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)