Pages that link to "Item:Q4857860"
From MaRDI portal
The following pages link to Non‐associative Lambek Categorial Grammar in Polynomial Time (Q4857860):
Displaying 9 items.
- Product-free Lambek calculus is NP-complete (Q408532) (← links)
- Unidirectional Lambek grammars in polynomial time (Q987373) (← links)
- Non-associative, non-commutative multi-modal linear logic (Q2104536) (← links)
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures (Q2369010) (← links)
- Lambek calculus is NP-complete (Q2500488) (← links)
- Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645) (← links)
- Product-Free Lambek Calculus Is NP-Complete (Q3605542) (← links)
- (Q5111318) (← links)
- Complexity of the universal theory of residuated ordered groupoids (Q6169326) (← links)
