Abstract
In this paper we prove that the Lambek calculus allowing empty antecedents and enriched with a unary connective corresponding to language reversal is complete with respect to the class of models on subsets of free monoids (L-models).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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)
Kuznetsov, S.: Lambek grammars with one division and one primitive type. Logic Journal of the IGPL 28(1), 207–221 (2012)
Kuznetsov, S.: L-completeness of the Lambek calculus with the reversal operation. In: Béchet, D., Dikovsky, A. (eds.) Logical Aspects of Computational Linguistics. LNCS, vol. 7351, pp. 151–160. Springer, Heidelberg (2012)
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. Diploma paper, Dept. of Math. Logic and Theory of Algorithms, Moscow State University (2001) (in Russian)
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)
Savateev, Y.: Product-free Lambek calculus is NP-complete. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 380–394. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kuznetsov, S. (2014). L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents. In: Casadio, C., Coecke, B., Moortgat, M., Scott, P. (eds) Categories and Types in Logic, Language, and Physics. Lecture Notes in Computer Science, vol 8222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54789-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-54789-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54788-1
Online ISBN: 978-3-642-54789-8
eBook Packages: Computer ScienceComputer Science (R0)