Abstract
We give an alternative proof of the fact that the product-free Lambek calculus is complete with respect to cofinite language models. It was first proved by Buszkowski in 1982 by the method of barriers. We use another method, which is also based on the technique of canonical models, to obtain a new proof of this result.
This research was partially supported by the Russian Foundation for Basic Research (grant 11-01-00958).
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 a Categorial Grammar with an Associated Category System. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 28, 229–237 (1982)
Buszkowski, W.: Some Decision Problems in the Theory of Syntactic Categories. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 28, 539–548 (1982)
Buszkowski, W.: The finite model property for BCI and related systems. Studia Logica 57, 303–323 (1996)
Buszkowski, W.: Finite Models of Some Substructural Logics. Math. Log. Q. 48(1), 63–72 (2002)
Farulewski, M.: On the Finite Models of the Lambek Calculus. Studia Logica 80, 63–74 (2005)
Lafont, Y.: The Finite Model Property for Various Fragments of Linear Logic. Journal of Symbolic Logic 62, 1202–1208 (1997)
Lambek, J.: The mathematics of sentence structure. American Mathematical Journal 65(3), 154–170 (1958)
Okada, M., Terui, K.: The Finite Model Property for Various Fragments of Intuinistic Linear Logic. The Journal of Symbolic Logic 64(2), 790–802 (1999)
Pentus, M.: Models for the Lambek calculus. The Annals of Pure and Applied Logic 75(1–2), 179–213 (1995)
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
Sorokin, A. (2012). On the Completeness of Lambek Calculus with Respect to Cofinite Language Models. 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_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-31262-5_16
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)