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].
Similar content being viewed by others
References
A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation and Compiling, Prentice-Hall, Englewood Cliffs, 1972.
K. Ajdukiewicz, Die syntaktische Konnexität, Studia Philosophica 1 (1935), pp. 1–27.
Y. Bar-Hillel, A quasi-arithmetical notation for syntactic description, Language 29 (1953), pp. 47–58.
Y. Bar-Hillel, C. Gaifman and E. Shamir, On categorial and phrase structure grammars, Bull. Res. Council Israel F 9 (1960), pp. 155–166.
J. Van Benthem, Essays in Logical Semantics, D. Reidel, Dordrecht, 1986.
W. Buszkowski, Algebraic models of categorial grammars, in: G. Dorn and P. Weingartner, (ed.), Foundations of Logic and Linguistics: Problems and Their Solutions, Plenum Press. New York, 1985.
W. Buszkowski, The equivalence of unidirectional Lambek categorial grammars and context-free grammars, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 31 (1985), pp. 369–384.
W. Buszkowski, Typed functorial languages, Bull. Pol. Acad. Scie. (Math.) 34 (1986), pp. 495–505.
W. Buszkowski, Generative capacity of nonassociative Lambek calculus, Bull. Pol. Acad. Scie. (Math.) 34 (1986), pp. 507–516.
W. Buszkowski, Generative power of categorial grammars, in: R. T. Oehrle, E. Bach and D. Wheeler (ed.), Categorial Grammars and Natural Language Structures, D. Reidel, Dordrecht, 1987.
M. J. Cresswell, Categorial languages, Studia Logica 36 (1977), pp. 257–269.
F. Gécseg and M. Steinby, Tree Automata, Akadémiai Kiadó, Budapest, 1984.
A. W. Gladkij, Formalnyje grammatiki i jazyki (in Russian), Nauka, Moskwa, 1973.
S. A. Greibach, A new normal-form theorem for context-free phrase structure grammars, J. Assoc. Computing Machinery 12 (1965), pp. 42–52.
J. Lambek, The mathematics of sentence structure, American Mathematical Monthly 65 (1958), pp. 154–170.
J. W. Thatcher, Characterizing derivation trees of context-free grammars through a generalization of finite automata theory, J. Comput. Systems Scie. 1 (1967), pp. 317–322.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Buszkowski, W. Gaifman's theorem on categorial grammars revisited. Stud Logica 47, 23–33 (1988). https://doi.org/10.1007/BF00374049
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00374049