On the equivalence of Ajdukiewicz-Lambek calculus and simple phrase structure grammars

Bulletin of the Section of Logic 5 (2):1-4 (1976)
  Copy   BIBTEX

Abstract

In [2], Bar-Hillel, Gaifman, and Shamir prove that the simple phrase structure grammars dened by Chomsky are equivalent in a cer- tain sense to Bar-Hillel's bidirectional categorial grammars . On the other hand, Cohen [3] proves the equivalence of the latter ones to what he calls free categorial grammars . They are closely related to Lambek's syntactic calculus which is, in turn, based on the idea due to Ajdukiewicz [1]. For some reasons, Cohen's proof seems to be at least in- complete. Here, I give a short outline of the direct proof of the equivalence between SF G's and F CG's

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Product-free Lambek calculus and context-free grammars.Mati Pentus - 1997 - Journal of Symbolic Logic 62 (2):648-660.
Extending Lambek grammars to basic categorial grammars.Wojciech Buszkowski - 1996 - Journal of Logic, Language and Information 5 (3-4):279-295.
Two Weak Lambek-Style Calculi: DNL and DNL.Wojciech Zielonka - 2012 - Logic and Logical Philosophy 21 (1):53-64.
Interdefinability of Lambekian functors.Wojciech Zielonka & W. Zielonka - 1992 - Mathematical Logic Quarterly 38 (1):501-507.

Analytics

Added to PP
2014-02-19

Downloads
23 (#666,649)

6 months
3 (#1,002,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references