Term Graphs and the NP-Completeness of the Product-Free Lambek Calculus

DOI10.1007/978-3-642-20169-1_10zbMath1231.03019OpenAlexW1545349388MaRDI QIDQ2999263

Timothy A. D. Fowler

Publication date: 11 May 2011

Published in: Formal Grammar (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Structure of proofs (03F07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Complexity of proofs (03F20)

This page was built for publication: Term Graphs and the NP-Completeness of the Product-Free Lambek Calculus