Pages that link to "Item:Q3605542"
From MaRDI portal
The following pages link to Product-Free Lambek Calculus Is NP-Complete (Q3605542):
Displayed 8 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- On translating context-free grammars into Lambek grammars (Q902051) (← links)
- Logical foundations for hybrid type-logical grammars (Q2135950) (← links)
- Natural language semantics and computability (Q2425328) (← links)
- Undecidability of the Lambek Calculus with a Relevant Modality (Q2835058) (← links)
- On Lambek’s Restriction in the Presence of Exponential Modalities (Q5283424) (← links)
- L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents (Q5414969) (← links)
- The Monotone Lambek Calculus Is NP-Complete (Q5414974) (← links)