We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial
On categorial grammar and logical form
โ Scribed by Witold Marciszewski
- Publisher
- Springer Netherlands
- Year
- 1978
- Tongue
- English
- Weight
- 300 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0039-3215
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The equivalence of (classical) categorial grammars and context-free grammars, proved by Gaifman [4], is a very basic result of the theory of formal grammars (an essentially equivalent result is known as the Greibach normal form theorem [1], [14]). We analyse the contents of Gaifman's theorem within
A good deal of Donald Davidson's important and widely influential paper, 'The Logical Form of Action Sentences', 1 is taken up with demonstrating the failure of the Kenny-Chisholm-von Wright style 2 account of the syntax of agency to adequately cope with a varied collection of problems. The approach