Deduction theorem for symmetric cirquent calculus

DOI10.1007/978-3-642-15660-1_9zbMATH Open1253.03062OpenAlexW2269631276MaRDI QIDQ3145140FDOQ3145140

Authors: Wenyan Xu, Sanyang Liu 

Publication date: 14 December 2012

Published in: Quantitative Logic and Soft Computing 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15660-1_9

Recommendations

• Cirquent Calculus Deepened
• A cirquent calculus system with clustering and ranking
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Elementary-base cirquent calculus. II: Choice quantifiers
• The computational complexity of propositional cirquent calculus

zbMATH Keywords

proof theorycirquent calculusdeduction theorem

Mathematics Subject Classification ID

Logic in computer science (03B70) Structure of proofs (03F07)

Cited In (4)

• Cirquent Calculus Deepened
• 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

This page was built for publication: Deduction theorem for symmetric cirquent calculus

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