A cirquent calculus system with clustering and ranking

DOI10.1016/j.jal.2016.04.003zbMath1436.03180arXiv1409.3290OpenAlexW261632136MaRDI QIDQ301368

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

IF logiccomputability logiccirquent calculus

Mathematics Subject Classification ID

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

Related Items (2)

Cirquent Calculus in a Nutshell ⋮ Build your own clarithmetic I: Setup and completeness

Cites Work

• Unnamed Item
• Introduction to computability logic
• Propositional logic of imperfect information: Foundations and applications
• 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
• The countable versus uncountable branching recurrences in computability logic
• Soundness and completeness of the Cirquent calculus system CL6 for computability logic
• On the proof complexity of deep inference
• From formulas to cirquents in computability logic
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Cirquent Calculus Deepened
• In the beginning was game semantics
• A propositional system induced by Japaridze's approach to IF logic
• The Computational Complexity of Propositional Cirquent Calculus
• Partiality and games: propositional logic

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