Product-Free Lambek Calculus Is NP-Complete

@inproceedings{Savateev2009ProductFreeLC,
  title={Product-Free Lambek Calculus Is NP-Complete},
  author={Yury Savateev},
  booktitle={LFCS},
  year={2009}
}
In this paper we prove that the derivability problems for product-free Lambek calculus and product-free Lambek calculus allowing empty premises are NPcomplete. Also we introduce a new derivability characterization for these calculi. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

A Graph-Theoretic Approach to Polynomial-Time Recognition with the Lambek Calculus

  • G. Penn
  • Electronic Notes in Theoretical Computer Science…
  • 2005
1 Excerpt

The mathematics of sentence structure

  • J. Lambek
  • American Mathematical Monthly 65 (3)
  • 1958
1 Excerpt

Similar Papers

Loading similar papers…