A faithful representation of non-associative Lambek grammars in abstract categorial grammars
DOI10.1007/S10849-009-9111-ZzbMATH Open1197.03032OpenAlexW2023138907MaRDI QIDQ972436FDOQ972436
Authors: Christian Retoré, S. Salvati 
Publication date: 26 May 2010
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00409557/file/nl_acg_retore_salvati_jolli.pdf
Recommendations
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)
Cites Work
- Title not available (Why is that?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Derivational minimalism
- The equivalence problem for deterministic MSO tree transducers is decidable
- On the expressive power of abstract categorial grammars: Representing context-free formalisms
- Title not available (Why is that?)
Cited In (9)
- Symmetric categorial grammar
- On the expressive power of abstract categorial grammars: Representing context-free formalisms
- On the membership problem for non-linear abstract categorial grammars
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures
- A note on the complexity of abstract categorial grammars
- On Two Extensions of Abstract Categorial Grammars
- CoTAGs and ACGs
- The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars
- Logical Aspects of Computational Linguistics
Uses Software
This page was built for publication: A faithful representation of non-associative Lambek grammars in abstract categorial grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972436)
