Gaifman's theorem on categorial grammars revisited

Studia Logica 47 (1):23 - 33 (1988)
  Copy   BIBTEX

Abstract

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 the framework of structure and type transformations. We give a new proof of this theorem which relies on the algebra of phrase structures and exhibit a possibility to justify the key construction used in Gaifman's proof by means of the Lambek calculus of syntactic types [15].

Links

PhilArchive



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

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
74 (#215,284)

6 months
21 (#116,730)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Extending Lambek grammars to basic categorial grammars.Wojciech Buszkowski - 1996 - Journal of Logic, Language and Information 5 (3-4):279-295.

Add more citations

References found in this work

Categorial languages.M. J. Cresswell - 1977 - Studia Logica 36 (4):257 - 269.
The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars.Wojcßch Buszkowski - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (24):369-384.

Add more references