{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T04:14:00Z","timestamp":1749096840681,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662530412"},{"type":"electronic","value":"9783662530429"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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-662-53042-9_14","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T13:36:04Z","timestamp":1470404164000},"page":"240-256","source":"Crossref","is-referenced-by-count":13,"title":["Undecidability of the Lambek Calculus with a Relevant Modality"],"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":[[2016,8,6]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","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 und Grundl. der Math. (Math. Logic Q.) 36, 11\u201315 (1990)","journal-title":"Zeitschr. f\u00fcr math. Logik und Grundl. der Math. (Math. Logic Q.)"},{"key":"14_CR2","doi-asserted-by":"crossref","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 Q.) 28, 539\u2013548 (1982)","journal-title":"Zeitschr. f\u00fcr math. Logik und Grundl. der Math. (Math. Logic Q.)"},{"key":"14_CR3","unstructured":"Buszkowski, W.: Lambek calculus with nonlogical axioms. In: Language and Grammar. CSLI Lecture Notes, vol. 168, pp. 77\u201393 (2005)"},{"key":"14_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":"14_CR5","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 50(1), 1\u2013102 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-39998-5_12","volume-title":"Formal Grammar","author":"M Kanazawa","year":"2013","unstructured":"Kanazawa, M., Salvati, S.: The string-meaning relations definable by Lambek grammars and context-free grammars. In: Morrill, G., Nederhof, M.-J. (eds.) Formal Grammar 2012 and 2013. LNCS, vol. 8036, pp. 191\u2013208. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39998-5_12"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-27683-0_11","volume-title":"Logical Foundations of Computer Science","author":"M Kanovich","year":"2016","unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: On Lambek\u2019s restriction in the presence of exponential modalities. In: Artemov, S., Nerode, A. (eds.) LFCS 2016. LNCS, vol. 9537, pp. 146\u2013158. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-27683-0_11"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1134\/S0081543815060061","volume":"290","author":"SL Kuznetsov","year":"2015","unstructured":"Kuznetsov, S.L.: On translating context-free grammars into Lambek grammars. Proc. Steklov Inst. Math. 290, 63\u201369 (2015)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"3","key":"14_CR9","doi-asserted-by":"crossref","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. Am. Math. Mon. 65(3), 154\u2013170 (1958)","journal-title":"Am. Math. Mon."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Lambek, J.: On the calculus of syntactic types. In: Proceedings of Symposia in Applied Mathematics: Structure of Language and its Mathematical Aspects, vol. 12, pp. 166\u2013178. AMS (1961)","DOI":"10.1090\/psapm\/012\/9972"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Ann. Pure Appl. Logic 56(1\u20133), 239\u2013311 (1992)","DOI":"10.1016\/0168-0072(92)90075-B"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Morrill, G., Valent\u00edn, O.: Computational coverage of TLG: nonlinearity. In: Proceedings of NLCS 2015. EPiC Series, vol. 32, pp. 51\u201363 (2015)","DOI":"10.29007\/96j5"},{"issue":"2","key":"14_CR13","doi-asserted-by":"crossref","first-page":"648","DOI":"10.2307\/2275553","volume":"62","author":"M Pentus","year":"1997","unstructured":"Pentus, M.: Product-free Lambek calculus and context-free grammars. J. Symbolic Logic 62(2), 648\u2013660 (1997)","journal-title":"J. Symbolic Logic"},{"key":"14_CR14","doi-asserted-by":"crossref","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":"14_CR15","first-page":"310","volume":"8","author":"M Pentus","year":"2010","unstructured":"Pentus, M.: Complexity of the Lambek calculus and its fragments. Adv. Modal Logic 8, 310\u2013329 (2010). College Publications","journal-title":"Adv. Modal Logic"},{"key":"14_CR16","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). doi: 10.1007\/978-3-540-79709-8_28"},{"key":"14_CR17","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). doi: 10.1007\/978-3-540-92687-0_26"},{"issue":"1","key":"14_CR18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.2307\/2274953","volume":"55","author":"DN Yetter","year":"1990","unstructured":"Yetter, D.N.: Quantales and (noncommutative) linear logic. J. Symbolic Logic 55(1), 41\u201364 (1990)","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53042-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T15:21:38Z","timestamp":1749050498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53042-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662530412","9783662530429"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53042-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}