The Lambek-Grishin calculus is NP-complete
Computation and Language
2010-08-26 v3
Abstract
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL. In this paper we prove that the derivability problem for LG is NP-complete.
Cite
@article{arxiv.1005.4697,
title = {The Lambek-Grishin calculus is NP-complete},
author = {Jeroen Bransen},
journal= {arXiv preprint arXiv:1005.4697},
year = {2010}
}