Product-free Lambek calculus and context-free grammars
From MaRDI portal
(Redirected from Publication:4358060)
Recommendations
Cites work
Cited in
(25)- Algebraic structures in categorial grammar
- Residuation, structural rules and context freeness
- On the recognizing power of the Lambek calculus with brackets
- Lambek calculus for transformational grammar
- A note on the strong and weak generative powers of formal systems
- Powerful and NP-complete: hypergraph Lambek grammars
- A restricted fragment of the Lambek calculus with iteration and intersection operations
- Kleene star, subexponentials without contraction, and infinite computations
- S4 enriched multimodal categorial grammars are context-free
- Parsing pregroup grammars and Lambek calculus using partial composition
- Computing interpolants in implicational logics
- Undecidability of the Lambek calculus with a relevant modality
- Lambek grammars with one division and one primitive type
- scientific article; zbMATH DE number 1341928 (Why is no real title available?)
- scientific article; zbMATH DE number 549973 (Why is no real title available?)
- scientific article; zbMATH DE number 1067867 (Why is no real title available?)
- The emptiness of intersection problem for languages of \(k\)-valued categorial grammars (classical and Lambek) is undecidable
- A graph-theoretic approach to sequent derivability in the Lambek calculus
- Pomset logic. The other approach to noncommutativity in logic
- The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars
- Extended Lambek calculi and first-order linear logic
- Logical Aspects of Computational Linguistics
- Proof-theoretic aspects of the logic of scope
- The Pentus theorem for Lambek calculus with simple nonlogical axioms
- On translating context-free grammars into Lambek grammars
This page was built for publication: Product-free Lambek calculus and context-free grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358060)
