A cirquent calculus system with clustering and ranking

DOI10.1016/J.JAL.2016.04.003MaRDI QIDQ301368zbMATH OpenOpenAlexFDO

Authors Wenyan Xu

Publication date 30 June 2016

Published in Journal of Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

computability logiccirquent calculusIF logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic in computer science (03B70)

Abstract: Cirquent calculus is a new proof-theoretic and semantic approach introduced by G.Japaridze for the needs of his theory of computability logic. The earlier article "From formulas to cirquents in computability logic" by Japaridze generalized the concept of cirquents to the version with what are termed clusterng and ranking, and showed that, through cirquents with clustering and ranking, one can capture, refine and generalize the so called extended IF logic. Japaridze's treatment of extended IF logic, however, was purely semantical, and no deductive system was proposed. The present paper syntactically constructs a cirquent calculus system with clustering and ranking, sound and complete w.r.t. the propositional fragment of cirquent-based semantics. Such a system can be considered not only a conservative extension of classical propositional logic but also, when limited to cirquents with no more than 2 ranks, an axiomatization of purely propositional extended IF logic in its full generality.

Recommendations

• A propositional system induced by Japaridze's approach to IF logic
• scientific article; zbMATH DE number 7594103
• Cirquent Calculus Deepened
• From formulas to cirquents in computability logic
• Introduction to Cirquent Calculus and Abstract Resource Semantics

Cites work

• A propositional system induced by Japaridze's approach to IF logic
• Cirquent Calculus Deepened
• From formulas to cirquents in computability logic
• In the beginning was game semantics
• Independence-friendly logic. A game-theoretic approach
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Introduction to computability logic
• On the proof complexity of deep inference
• Partiality and games: Propositional logic
• Propositional logic of imperfect information: Foundations and applications
• Soundness and completeness of the cirquent calculus system CL6 for computability logic
• The computational complexity of propositional cirquent calculus
• The countable versus uncountable branching recurrences in computability logic
• The parallel versus branching recurrences in computability logic
• The taming of recurrences in computability logic through cirquent calculus. I
• The taming of recurrences in computability logic through cirquent calculus. II

Cited in

(8)

• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Cirquent Calculus Deepened
• Build your own clarithmetic. I: Setup and completeness
• Elementary-base cirquent calculus. II: Choice quantifiers
• Deduction theorem for symmetric cirquent calculus
• Cirquent Calculus in a Nutshell
• The computational complexity of propositional cirquent calculus
• A propositional cirquent calculus for computability logic.

This page was built for publication: A cirquent calculus system with clustering and ranking

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