The Computational Complexity of Propositional Cirquent Calculus

DOI10.2168/LMCS-11(1:12)2015zbMath1328.03043arXiv1401.1849MaRDI QIDQ5246717

Matthew S. Bauer

Publication date: 22 April 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

proof theorysubstructural logicscomputability logicresource semanticscirquent calculus

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Structure of proofs (03F07) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (3)

A cirquent calculus system with clustering and ranking ⋮ Cirquent Calculus in a Nutshell ⋮ Build your own clarithmetic I: Setup and completeness

This page was built for publication: The Computational Complexity of Propositional Cirquent Calculus