Product-free Lambek calculus is NP-complete (Q408532): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B47 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6022765 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Lambek calculus | |||
Property / zbMATH Keywords: Lambek calculus / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
algorithmic complexity | |||
Property / zbMATH Keywords: algorithmic complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
proof nets | |||
Property / zbMATH Keywords: proof nets / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
derivability | |||
Property / zbMATH Keywords: derivability / rank | |||
Normal rank |
Revision as of 18:02, 29 June 2023
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