Pages that link to "Item:Q2904061"
From MaRDI portal
The following pages link to Complexity of the Lambek calculus and its fragments (Q2904061):
Displaying 13 items.
- On finite models of the Lambek calculus (Q813074) (← links)
- On the complexity of nonassociative Lambek calculus with unit (Q1035836) (← links)
- On the complexity of the Leibniz hierarchy (Q1740630) (← links)
- Multimodal linguistic inference (Q1923840) (← links)
- Complexity of Lambek calculi with modalities and of total derivability in grammars (Q2066100) (← links)
- A restricted fragment of the Lambek calculus with iteration and intersection operations (Q2213927) (← links)
- Lambek calculus is NP-complete (Q2500488) (← links)
- Undecidability of the Lambek Calculus with a Relevant Modality (Q2835058) (← links)
- The Complexity of Enriched Mu-Calculi (Q3535618) (← links)
- (Q3714467) (← links)
- Non-associative Lambek calculus with modalities: interpolation, complexity and FEP (Q5172137) (← links)
- An application of proof-nets to the study of fragments of the Lambek calculus (Q5198508) (← links)
- Craig’s trick and a non-sequential system for the Lambek calculus and its fragments (Q5382579) (← links)