Abstract
Lambek [14] introduces pregroups as a new framework for syntactic structure. In this paper we prove some new theorems on pregroups and study grammars based on the calculus of free pregroups. We prove that these grammars are equivalent to context-free grammars. We also discuss the relation of pregroups to the Lambek calculus.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
V.M. Abrusci, Lambek Calculus, Cyclic Multiplicative-Additive Linear Logic, Noncommutative Multiplicative-Additive Linear Logic: language and sequent calculus, in: V.M. Abrusci and C. Casadio (eds.), Proofs and Linguistic Categories, Proc. 1996 Roma Workshop, Bologna, 1996, 21–48.
K. Ajdukiewicz, Die syntaktische Konnexität, Studia Philosophica 1 (1935), 1–27.
Y. Bar-Hillel, C. Gaifman and E. Shamir, On categorial and phrase structure grammars, Bull. Res. Council Israel F 9 (1960), 155–166.
W. Buszkowski, Completeness results for Lambek Syntactic Calculus, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 32 (1986), 13–28.
W. Buszkowski, Generative capacity of nonassociative Lambek calculus, Bull. Polish Academy Scie. Math. 34 (1986), 507–516.
W. Buszkowski, Extending Lambek grammars to basic categorial grammars, Journal of Logic, Language and Information 5 (1996), 279–295.
W. Buszkowski, Mathematical linguistics and proof theory, in: J. van Benthem and A. ter Meulen (eds.), Handbook of Logic and Language, Elsevier, Amsterdam, MIT Press, Cambridge Mass., 1997, 683–736.
W. Buszkowski, Pregroups and grammars, Proc. 6th Roma Workshop, to appear.
L. Fuchs, Partially Ordered Algebraic Systems, Pergamon Press, Oxford, 1963.
S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.
M. Kandulski, The equivalence of nonassociative Lambek categorial grammars and context-free grammars, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 34 (1988), 41–52.
A. Kiślak, Parsing based on pre-groups. Comments on the new Lambek theory of syntactic structure, in: Y. Hamamatsu, W. Kosiński, L. Polkowski, M. Toho and T. Yonekura (eds.), Formal Methods and Intelligent Techniques in Control, Decision Making, Multimedia, and Robotics, Polish-Japanese Institute of Information Technology, Warsaw, 2000, 41–49.
J. Lambek, The mathematics of sentence structure, American Mathematical Monthly 65 (1958), 154–170.
J. Lambek, Type grammars revisited, in: A. Lecomte, F. Lamarche and G. Perrier (eds.), Logical Aspects of Computational Linguistics, LNAI 1582, Springer, Berlin, 1999, 1–27.
M. Pentus, Lambek grammars are context-free. Prepublication Series: Mathematical Logic and Theoretical Computer Science 8, Steklov Mathematical Institute, Moscow, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buszkowski, W. (2001). Lambek Grammars Based on Pregroups. In: de Groote, P., Morrill, G., Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 2001. Lecture Notes in Computer Science(), vol 2099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48199-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-48199-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42273-0
Online ISBN: 978-3-540-48199-7
eBook Packages: Springer Book Archive