Product-Free Lambek Calculus Is NP-Complete

Authors:
Yury Savateev
Affiliations:
Department of Mathematical Logic, Faculty of Mechanics and Mathematics, Moscow State University, Moscow, Russia 119991
Venue:
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Year:
2009

Citing 3
Cited 2

The Non-Associative Lambek Calculus with Product in Polynomial Time

TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Lambek calculus is NP-complete

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Lambek grammars with one division are decidable in polynomial time

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications

The product-free Lambek-Grishin calculus is NP-complete

LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
The Lambek-Grishin calculus is NP-Complete

FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we prove that the derivability problems for product-free Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a new derivability characterization for these calculi.