Product-free Lambek calculus is NP-complete (Q408532): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.APAL.2011.09.017 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.APAL.2011.09.017 / rank | |||
Normal rank | |||
Latest revision as of 16:42, 9 December 2024
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
