The following pages link to Lambek calculus is NP-complete (Q2500488):
Displaying 29 items.
- Current trends in substructural logics (Q266641) (← links)
- Product-free Lambek calculus is NP-complete (Q408532) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- On translating Lambek grammars with one division into context-free grammars (Q511445) (← links)
- Infinitary action logic: complexity, models and grammars (Q935019) (← links)
- Unidirectional Lambek grammars in polynomial time (Q987373) (← links)
- Algebraic structures in categorial grammar (Q1129119) (← links)
- Lambek calculus and its relational semantics: Completeness and incompleteness (Q1314508) (← links)
- Pregroup grammars with letter promotions: complexity and context-freeness (Q1757847) (← links)
- Models for the Lambek calculus (Q1899151) (← links)
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
- Complexity of Lambek calculi with modalities and of total derivability in grammars (Q2066100) (← links)
- Infinitary action logic with exponentiation (Q2067638) (← links)
- Hypergraph Lambek grammars (Q2079680) (← links)
- Non-associative, non-commutative multi-modal linear logic (Q2104536) (← links)
- Powerful and NP-complete: hypergraph Lambek grammars (Q2117261) (← links)
- Logical foundations for hybrid type-logical grammars (Q2135950) (← links)
- Kleene star, subexponentials without contraction, and infinite computations (Q2234420) (← links)
- Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids (Q2317378) (← links)
- On involutive nonassociative Lambek calculus (Q2425321) (← links)
- Type logics and pregroups (Q2467212) (← links)
- Recognition of derivability for the Lambek calculus with one division (Q2513061) (← links)
- The finite model property for BCI and related systems (Q2563452) (← links)
- Undecidability of the Lambek Calculus with a Relevant Modality (Q2835058) (← links)
- Proof Nets for the Displacement Calculus (Q2835060) (← links)
- Good Types Are Useful for Learning (Q3013026) (← links)
- Lambek Grammars with One Division Are Decidable in Polynomial Time (Q3503645) (← links)
- Product-Free Lambek Calculus Is NP-Complete (Q3605542) (← links)
- (Q5111318) (← links)
