The Product-Free Lambek-Grishin Calculus Is NP-Complete

DOI10.1007/978-3-642-22221-4_4zbMATH Open1333.03009OpenAlexW155046408MaRDI QIDQ3010336

Jeroen Bransen

Publication date: 1 July 2011

Published in: Logical Aspects of Computational Linguistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22221-4_4

Mathematics Subject Classification ID

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)

Related Items (1)

Lambek calculus is NP-complete

This page was built for publication: The Product-Free Lambek-Grishin Calculus Is NP-Complete

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