Geach’s Categorial Grammar
✍ Scribed by Lloyd Humberstone
- Publisher
- Springer Netherlands
- Year
- 2005
- Tongue
- English
- Weight
- 241 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0165-0157
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
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
Pentus (1992) proves the equivalence of LCG's and CFG's, and CFG's are equivalent to BCG's by the Gaifman theorem (Bar-Hillel et al., 1960). This paper provides a procedure to extend any LCG to an equivalent BCG by affixing new types to the lexicon; a procedure of that kind was proposed as early,