Abstract
In this paper we explore the residuation laws that are at the basis of the Lambek calculus, and more generally of categorial grammar. We intend to show how such laws are characterized in the framework of a purely non-commutative fragment of linear logic, known as Cyclic Multiplicative Linear Logic.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Abrusci, V.M., Ruet, P.: Non-commutative Logic I: The multiplicative fragment. Ann. Pure Appl. Logic 101(1), 29–64 (1999)
Abrusci, M.: Classical Conservative Extensions of Lambek Calculus. Studia Logica 71, 277–314 (2002)
Bernardi, R., Moortgat, M.: Continuation Semantics for the Lambek-Grishin Calculus. Inf. Comput. 208(5), 397–416 (2010)
Buszkowski, W.: Type Logics and Pregroups. Studia Logica 87(2/3), 145–169 (2007)
Buszkowski, W., Farulewski, M.: Nonassociative Lambek Calculus with Additives and Context-Free Languages. In: Grumberg, O., Kaminski, M., Katz, S., Wintner, S. (eds.) Francez Festschrift. LNCS, vol. 5533, pp. 45–58. Springer, Heidelberg (2009)
Buszkowski, W.: Lambek Calculus and Substructural Logics. Linguistic Analysis 36(1-4), 15–48 (2010)
Buszkowski, W.: Interpolation and FEP for Logics of Residuated Algebras. Logic Journal of the IGPL 19(3), 437–454 (2011)
Casadio, C., Lambek, J.: A Tale of Four Grammars. Studia Logica 71, 315–329 (2002)
Casadio, C., Lambek, J. (eds.): Recent Computational Algebraic Approaches to Morphology and Syntax. Polimetrica, Milan (2008)
Lambek, J.: The Mathematics of Sentence Structure. The American Mathematical Monthly 65(3), 154–170 (1958)
Lambek, J.: From Word to Sentence. A Computational Algebraic Approach to Grammar. Polimetrica International Publisher, Monza (2008)
Lambek, J.: Logic and Grammar. Studia Logica 100(4), 667–681 (2012)
Moortgat, M.: Symmetric Categorial Grammar: Residuation and Galois Connections. Linguistic Analysis 36(1-4), 143–166 (2010)
Moortgat, M., Moot, R.: Proof-nets for the Lambek-Grishin Calculus. CoRR abs/1112.6384 (2011)
Retoré, C.: Handsome proof nets: perfect matchings and cographs. Theoretical Computer Science 294(3) (2003)
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
Abrusci, V.M. (2014). On Residuation. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-54789-8_2
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)