A direct proof of the equivalence of free categorial grammars and simple phrase structure grammars

Studia Logica 37 (1):41 - 57 (1978)
  Copy   BIBTEX

Abstract

In [2], Bar-Hillel, Gaifman, and Shamir prove that the simple phrase structure grammars (SPGs) defined by Chomsky are equivalent in a certain sense to Bar-Hillel's bidirectional categorial grammars (BCGs). On the other hand, Cohen [3] proves the equivalence of the latter ones to what the calls free categorial grammars (FCGs). They are closely related to Lambek's syntactic calculus which, in turn, is based on the idea due to Ajdukiewicz [1]. For the reasons which will be discussed in the last section, Cohen's proof seems to be at least incomplete. This paper yields a direct proof of the equivalence ofFCGs andSPGs.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,497

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
51 (#314,939)

6 months
24 (#119,438)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Axiomatizability of Ajdukiewicz-Lambek Calculus by Means of Cancellation Schemes.Wojciech Zielonka - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (13-14):215-224.
The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars.Maciej Kandulski - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):41-52.

View all 7 citations / Add more citations

References found in this work

No references found.

Add more references