Abstract
We extend the Lambek calculus with rules for a unary operation corresponding to language reversal and prove that this calculus is complete with respect to the class of models on subsets of free semigroups (L-models). We also prove that categorial grammars based on this calculus generate precisely all context-free languages without the empty word.
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
Buszkowski, W.: Compatibility of categorial grammar with an associated category system. Zeitschr. für Math. Logik und Grundl. der Math. 28, 229–238 (1982)
Lambek, J.: The mathematics of sentence structure. American Math. Monthly 65(3), 154–170 (1958)
Lambek, J.: From categorial grammar to bilinear logic. In: Došen, K., Schroeder-Heister, P. (eds.) Substructural Logics. Studies in Logic and Computation, vol. 2, pp. 128–139. Clarendon Press, Oxford (1993)
Minina, V. A.: Completeness of the Lambek syntactic calculus with the involution operation (in Russian). Diploma paper, Dept. of Math. Logic and Theory of Algorithms, Moscow State University (2001)
Pentus, M.: Lambek grammars are context free. In: 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429–433. IEEE Computer Society Press, Los Alamitos (1993)
Pentus, M.: Models for the Lambek calculus. Annals of Pure and Applied Logic 75(1–2), 179–213 (1995)
Pentus, M.: Free monoid completeness of the Lambek calculus allowing empty premises. In: Larrazabal, J.M., Lascar, D., Mints, G. (eds.) Logic Colloquium 1996. LNL, vol. 12, pp. 171–209. Springer, Berlin (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuznetsov, S. (2012). L-Completeness of the Lambek Calculus with the Reversal Operation. In: Béchet, D., Dikovsky, A. (eds) Logical Aspects of Computational Linguistics. LACL 2012. Lecture Notes in Computer Science, vol 7351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31262-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-31262-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31261-8
Online ISBN: 978-3-642-31262-5
eBook Packages: Computer ScienceComputer Science (R0)