Recognition of derivability for the Lambek calculus with one division
From MaRDI portal
Recommendations
- Lambek calculus with one division and one primitive type permitting empty antecedents
- Lambek calculus with a unit and one division
- Iterative division in the distributive full non-associative Lambek calculus
- Calculi in which derivability is decidable by finite interpretations
- On the recognizing power of the Lambek calculus with brackets
- Complexity of the Lambek calculus with one division and a negative-polarity modality for weakening
- The Lambek calculus with iteration: two variants
- One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus
- Lambek Calculus in Natural Deduction
- Conjoinability in 1-discontinuous Lambek calculus
Cites work
Cited in
(7)- Complexity of Lambek calculi with modalities and of total derivability in grammars
- Proof nets for the Lambek calculus with one division and a negative-polarity modality for weakening
- Complexity of the Lambek calculus with one division and a negative-polarity modality for weakening
- Lambek Grammars with One Division Are Decidable in Polynomial Time
- The atomic theory of left division of two-sided ideals of semirings with unit
- On translating Lambek grammars with one division into context-free grammars
- Unidirectional Lambek grammars in polynomial time
This page was built for publication: Recognition of derivability for the Lambek calculus with one division
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513061)