Abstract
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called “Lambek’s restriction,” that is, the antecedent of any provable sequent should be non-empty. In this paper we discuss ways of extending the Lambek calculus with the linear logic exponential modality while keeping Lambek’s restriction. We present several versions of the Lambek calculus extended with exponential modalities and prove that those extensions are undecidable, even if we take only one of the two divisions provided by the Lambek calculus.
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
References
Abrusci, V.M.: A comparison between Lambek syntactic calculus and intuitionistic linear propositional logic. Zeitschr. für math. Logik and Grundl. der Math. (Math. Logic Quart.) 36, 11–15 (1990)
Andreoli, J.-M.: Logical programming with focusing proofs in linear logic. J. Log. Comput. 2, 297–347 (1992)
Buszkowski, W.: Some decision problems in the theory of syntactic categories. Zeitschr. für math. Logik und Grundl. der Math. (Math. Logic Quart.) 28, 539–548 (1982)
Carpenter, B.: Type-logical semantics. MIT Press, Cambridge (1998)
Girard, J.-Y.: Linear logic. Theor. Comp. Sci. 50(1), 1–102 (1987)
de Groote, P.: On the expressive power of the Lambek calculus extended with a structural modality. In: Casadio, C., et al. (eds.) Language and Grammar. CSLI Lect. Notes, vol. 168, pp. 95–111. Stanford University, Stanford (2005)
Kanazawa, M.: Lambek calculus: Recognizing power and complexity. In: Gerbrandy, J., et al. (eds.) JFAK. Essays dedicated to Johan van Benthem on the occasion of his 50th birthday. Vossiuspers, Amsterdam Univ. Press (1999)
Kanovich, M.: The expressive power of modalized purely implicational calculi. CSLI Report. Stanford University (1993)
Lambek, J.: The mathematics of sentence structure. Amer. Math. Monthly 65(3), 154–170 (1958)
Lambek, J.: On the calculus of syntactic types. In: Jakobson (ed.) Structure of Language and Its Mathematical Aspects. Proc. Symposia Appl. Math., vol. 12, pp. 166–178. AMS, Providence, RI (1961)
Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Ann. Pure Appl. Log. 56, 239–311 (1992)
Moot, R., Retoré, C. (eds.): The Logic of Categorial Grammars. LNCS, vol. 6850. Springer, Heidelberg (2012)
Morrill, G., Leslie, N., Hepple, M., Barry, G.: Categorial deductions and structural operations. In: Barry, G., Morrill, G. (eds.) Studies in Categorial Grammar. Edinburgh Working Papers in Cognitive Science, vol. 5, pp. 1–21. Centre for Cognitive Science, Edinburgh (1990)
Morril, G.: Categorial grammar. Logical syntax, semantics, and processing. Oxford University Press, Oxford (2011)
Nigam, V., Miller, D.: Focusing in linear meta-logic. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 507–522. Springer, Heidelberg (2008)
Nigam, V., Miller, D.: Algorithmic specifications in linear logic with subexponentials. In: Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming, pp. 129–140 (2009)
Pentus, M.: Lambek grammars are context-free. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429–433. IEEE Computer Society Press (1993)
Pentus, M.: Lambek calculus is NP-complete. Theor. Comput. Sci. 357, 186–201 (2006)
Savateev, Y.: Lambek grammars with one division are decidable in polynomial time. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) Computer Science – Theory and Applications. LNCS, vol. 5010, pp. 273–282. Springer, Heidelberg (2008)
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)
Savateev, Yu.: Algorithmic complexity of fragments of the Lambek calculus (in Russian). Ph.D. thesis. Moscow State University (2009)
Yetter, D.N.: Quantales and (noncommutative) linear logic. J. Sym. Log. 55(1), 41–64 (1990)
Acknowledgments
Stepan Kuznetsov’s research was supported by the Russian Foundation for Basic Research (grants 15-01-09218-a and 14-01-00127-a) and by the Presidential Council for Support of Leading Scientific Schools of Russia (grant NŠ 1423.2014.1). Max Kanovich’s research was partly supported by EPSRC (grant EP/K040049/1).
This research was initiated during the visit by Stepan Kuznetsov to the University of Pennsylvania, which was supported in part by that institution. Further work was done during the stay of Kanovich and Scedrov at the National Research University Higher School of Economics, which was supported in part by that institution. We would like to thank Sergei O. Kuznetsov and Ilya A. Makarov for hosting us.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Kanovich, M., Kuznetsov, S., Scedrov, A. (2016). On Lambek’s Restriction in the Presence of Exponential Modalities. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2016. Lecture Notes in Computer Science(), vol 9537. Springer, Cham. https://doi.org/10.1007/978-3-319-27683-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-27683-0_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27682-3
Online ISBN: 978-3-319-27683-0
eBook Packages: Computer ScienceComputer Science (R0)