Abstract
Grishin ([9]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([14]), who spoke of the Lambek-Grishin calculus (LG). In this paper, we adapt Girard’s polarity-sensitive double negation embedding for classical logic ([7]) to extract a compositional Montagovian semantics from a display calculus for focused proof search ([1]) in LG. We seize the opportunity to illustrate our approach alongside an analysis of extraction, providing linguistic motivation for linear distributivity of tensor over par ([3]), thus answering a question of [10]. We conclude by comparing our proposal to that of [2], where alternative semantic interpretations of LG are considered on the basis of call-by-name and call-by-value evaluation strategies.
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
Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation 2(3), 297–347 (1992)
Bernardi, R., Moortgat, M.: Continuation Semantics for Symmetric Categorial Grammar. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol. 4576, pp. 53–71. Springer, Heidelberg (2007)
Cockett, J.R.B., Seely, R.A.G.: Weakly distributive categories. Journal of Pure and Applied Algebra, 45–65 (1991)
Danos, V., Joinet, J.-B., Schellinx, H.: LKQ and LKT: Sequent calculi for second order logic based upon dual linear decompositions of classical implication. In: Proceedings of the workshop on Advances in Linear Logic, New York, NY, USA, pp. 211–224. Cambridge University Press (1995)
De Groote, P., Lamarche, F.: Classical Non Associative Lambek Calculus. Studia Logica 71, 355–388 (2002)
Došen, K., Petrić, Z.: Proof-theoretical Coherence. King’s College Publications (2004)
Girard, J.-Y.: A new constructive logic: Classical logic. Mathematical Structures in Computer Science 1(3), 255–296 (1991)
Goré, R.: Substructural logics on display. Logic Journal of the IGPL 6(3), 451–504 (1998)
Grishin, V.N.: On a generalization of the Ajdukiewicz-Lambek system. In: Mikhailov, A.I. (ed.) Studies in Nonclassical Logics and Formal Systems, Nauka, Moscow, pp. 315–334 (1983)
Kurtonina, N., Moortgat, M.: Relational semantics for the Lambek-Grishin calculus. Mathematics of Language. Citeseerx (2007), doi:10.1.1.92.3297
Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly 65, 154–169 (1958)
Lambek, J.: On the calculus of syntactic types. In: Jakobson, R. (eds.) tructure of Language and its Mathematical Aspects, Proceedings of the Twelfth Symposium in Applied Mathematics (1961)
Moortgat, M.: Categorial type logics. In: Handbook of Logic and Language, pp. 93–177. Elsevier (1997)
Moortgat, M.: Symmetric categorial grammar. Journal of Philosophical Logic 38(6), 681–710 (2009)
Moortgat, M.: Symmetric categorial grammar: residuation and Galois connections. Linguistic Analysis. Special Issue Dedicated to Jim Lambek 36(1-4) (2010)
Okada, M.: A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theoretical Computer Science 281(1-2), 471–498 (2002)
Prawitz, D.: Natural Deduction. Dover Publications (2006)
Smullyan, R.M.: First–Order Logic. Springer (1968); Revised edn. Dover Press, NY (1994)
Reus, B., Lafont, Y., Streichter, T.: Continuation semantics or expressing implication by negation. Technical Report 93-21. University of Munich (1993)
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
Bastenhof, A. (2012). Polarized Montagovian Semantics for the Lambek-Grishin Calculus. In: de Groote, P., Nederhof, MJ. (eds) Formal Grammar. FG FG 2010 2011. Lecture Notes in Computer Science, vol 7395. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32024-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-32024-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32023-1
Online ISBN: 978-3-642-32024-8
eBook Packages: Computer ScienceComputer Science (R0)