{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:12:31Z","timestamp":1748751151838,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276823"},{"type":"electronic","value":"9783319276830"}],"license":[{"start":{"date-parts":[[2015,12,10]],"date-time":"2015-12-10T00:00:00Z","timestamp":1449705600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-27683-0_11","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T21:16:29Z","timestamp":1449695789000},"page":"146-158","source":"Crossref","is-referenced-by-count":3,"title":["On Lambek\u2019s Restriction in the Presence of Exponential Modalities"],"prefix":"10.1007","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]},{"given":"Stepan","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,10]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/malq.19900360103","volume":"36","author":"VM Abrusci","year":"1990","unstructured":"Abrusci, V.M.: A comparison between Lambek syntactic calculus and intuitionistic linear propositional logic. Zeitschr. f\u00fcr math. Logik and Grundl. der Math. (Math. Logic Quart.) 36, 11\u201315 (1990)","journal-title":"Zeitschr. f\u00fcr math. Logik and Grundl. der Math. (Math. Logic Quart.)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J-M Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logical programming with focusing proofs in linear logic. J. Log. Comput. 2, 297\u2013347 (1992)","journal-title":"J. Log. Comput."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1002\/malq.19820283308","volume":"28","author":"W Buszkowski","year":"1982","unstructured":"Buszkowski, W.: Some decision problems in the theory of syntactic categories. Zeitschr. f\u00fcr math. Logik und Grundl. der Math. (Math. Logic Quart.) 28, 539\u2013548 (1982)","journal-title":"Zeitschr. f\u00fcr math. Logik und Grundl. der Math. (Math. Logic Quart.)"},{"key":"11_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6945.001.0001","volume-title":"Type-logical semantics","author":"B Carpenter","year":"1998","unstructured":"Carpenter, B.: Type-logical semantics. MIT Press, Cambridge (1998)"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comp. Sci. 50(1), 1\u2013102 (1987)","journal-title":"Theor. Comp. Sci."},{"key":"11_CR6","series-title":"CSLI Lect. Notes","first-page":"95","volume-title":"Language and Grammar","author":"P Groote de","year":"2005","unstructured":"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\u2013111. Stanford University, Stanford (2005)"},{"key":"11_CR7","unstructured":"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)"},{"key":"11_CR8","unstructured":"Kanovich, M.: The expressive power of modalized purely implicational calculi. CSLI Report. Stanford University (1993)"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. Amer. Math. Monthly 65(3), 154\u2013170 (1958)","journal-title":"Amer. Math. Monthly"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013178. AMS, Providence, RI (1961)","DOI":"10.1090\/psapm\/012\/9972"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0168-0072(92)90075-B","volume":"56","author":"P Lincoln","year":"1992","unstructured":"Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Ann. Pure Appl. Log. 56, 239\u2013311 (1992)","journal-title":"Ann. Pure Appl. Log."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"The Logic of Categorial Grammars","year":"2012","unstructured":"Moot, R., Retor\u00e9, C. (eds.): The Logic of Categorial Grammars. LNCS, vol. 6850. Springer, Heidelberg (2012)"},{"key":"11_CR13","series-title":"Edinburgh Working Papers in Cognitive Science","first-page":"1","volume-title":"Studies in Categorial Grammar","author":"G Morrill","year":"1990","unstructured":"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\u201321. Centre for Cognitive Science, Edinburgh (1990)"},{"key":"11_CR14","series-title":"Logical syntax, semantics, and processing","volume-title":"Categorial grammar","author":"G Morril","year":"2011","unstructured":"Morril, G.: Categorial grammar. Logical syntax, semantics, and processing. Oxford University Press, Oxford (2011)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-540-71070-7_42","volume-title":"Automated Reasoning","author":"V Nigam","year":"2008","unstructured":"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\u2013522. Springer, Heidelberg (2008)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013140 (2009)","DOI":"10.1145\/1599410.1599427"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Pentus, M.: Lambek grammars are context-free. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429\u2013433. IEEE Computer Society Press (1993)","DOI":"10.1109\/LICS.1993.287565"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.tcs.2006.03.018","volume":"357","author":"M Pentus","year":"2006","unstructured":"Pentus, M.: Lambek calculus is NP-complete. Theor. Comput. Sci. 357, 186\u2013201 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-79709-8_28","volume-title":"Computer Science \u2013 Theory and Applications","author":"Y Savateev","year":"2008","unstructured":"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 \u2013 Theory and Applications. LNCS, vol. 5010, pp. 273\u2013282. Springer, Heidelberg (2008)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-540-92687-0_26","volume-title":"Logical Foundations of Computer Science","author":"Y Savateev","year":"2008","unstructured":"Savateev, Y.: Product-free lambek calculus is NP-complete. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 380\u2013394. Springer, Heidelberg (2008)"},{"key":"11_CR21","unstructured":"Savateev, Yu.: Algorithmic complexity of fragments of the Lambek calculus (in Russian). Ph.D. thesis. Moscow State University (2009)"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.2307\/2274953","volume":"55","author":"DN Yetter","year":"1990","unstructured":"Yetter, D.N.: Quantales and (noncommutative) linear logic. J. Sym. Log. 55(1), 41\u201364 (1990)","journal-title":"J. Sym. Log."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27683-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T18:39:36Z","timestamp":1748716776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27683-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,10]]},"ISBN":["9783319276823","9783319276830"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27683-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,10]]}}}