Product-free Lambek calculus is NP-complete (Q408532)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Product-free Lambek calculus is NP-complete |
scientific article |
Statements
Product-free Lambek calculus is NP-complete (English)
0 references
10 April 2012
0 references
Lambek calculus
0 references
algorithmic complexity
0 references
proof nets
0 references
derivability
0 references
