{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:47:08Z","timestamp":1769971628340,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662595329","type":"print"},{"value":"9783662595336","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_22","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T23:02:35Z","timestamp":1561244555000},"page":"356-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Complexity of Multiplicative-Additive Lambek Calculus: 25\u00a0Years\u00a0Later"],"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":[[2019,6,9]]},"reference":[{"key":"22_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 logic. Zeitschr. Math. Logik Grundl. Math. (Math. Logic Q.) 36, 11\u201315 (1990)","journal-title":"Zeitschr. Math. Logik Grundl. Math. (Math. Logic Q.)"},{"key":"22_CR2","first-page":"1","volume":"9F","author":"Y Bar-Hillel","year":"1960","unstructured":"Bar-Hillel, Y., Gaifman, C., Shamir, E.: On categorial and phrase-structure grammars. Bull. Res. Council Israel 9F, 1\u201316 (1960)","journal-title":"Bull. Res. Council Israel"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1002\/malq.19850312402","volume":"31","author":"W Buszkowski","year":"1985","unstructured":"Buszkowski, W.: The equivalence of unidirectional Lambek categorial grammars and context-free grammars. Zeitschr. Math. Log. Grundl. Math. 31, 369\u2013384 (1985)","journal-title":"Zeitschr. Math. Log. Grundl. Math."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Carpenter, B.: Type-Logical Semantics. MIT Press (1998)","DOI":"10.7551\/mitpress\/6945.001.0001"},{"issue":"1","key":"22_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. Comput. Sci. 50(1), 1\u2013101 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"31","key":"22_CR6","doi-asserted-by":"publisher","first-page":"3992","DOI":"10.1016\/j.tcs.2011.04.004","volume":"412","author":"R Hor\u010d\u00edk","year":"2011","unstructured":"Hor\u010d\u00edk, R., Terui, K.: Disjunction property and complexity of substructural logics. Theor. Comput. Sci. 412(31), 3992\u20134006 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S012905410800584X","volume":"19","author":"A Je\u017c","year":"2008","unstructured":"Je\u017c, A.: Conjunctive grammars can generate non-regular unary languages. Internat. J. Found. Comput. Sci. 19(3), 597\u2013615 (2008)","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"2","key":"22_CR8","first-page":"141","volume":"1","author":"M Kanazawa","year":"1992","unstructured":"Kanazawa, M.: The Lambek calculus enriched with additional connectives. J. Log. Lang. Inform. 1(2), 141\u2013171 (1992)","journal-title":"J. Log. Lang. Inform."},{"key":"22_CR9","volume-title":"JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday","author":"M Kanazawa","year":"1990","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. Amsterdam University Press, Vossiuspers (1990)"},{"key":"22_CR10","unstructured":"Kanovich, M.I.: Horn fragments of non-commutative logics with additives are PSPACE-complete. In: Proceedings 1994 Annual Conference of the European Association for Computer Science Logic, Kazimierz, Poland (1994)"},{"key":"22_CR11","series-title":"London Mathematical Society Lecture Notes","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1017\/CBO9780511629150.007","volume-title":"Advances in Linear Logic","author":"M Kanovich","year":"1995","unstructured":"Kanovich, M.: The direct simulation of Minsky machines in linear logic. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Notes, vol. 222, pp. 123\u2013145. Cambridge University Press, Cambridge (1995)"},{"issue":"5","key":"22_CR12","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1017\/S0960129516000049","volume":"26","author":"MI Kanovich","year":"2016","unstructured":"Kanovich, M.I.: The undecidability theorem for the Horn-like fragment of linear logic (Revisited). Math. Struct. Comput. Sci. 26(5), 719\u2013744 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kuznetsov, S., Nigam, V., Scedrov, A.: Subexponentials in non-commutative linear logic. Math. Struct. Comput. Sci. (2018). Part of Dale Miller\u2019s Festschrift","DOI":"10.1017\/S0960129518000117"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-39998-5_15","volume-title":"Formal Grammar","author":"S Kuznetsov","year":"2013","unstructured":"Kuznetsov, S.: Conjunctive grammars in Greibach normal form and the Lambek calculus with additive connectives. In: Morrill, G., Nederhof, M.-J. (eds.) FG 2012-2013. LNCS, vol. 8036, pp. 242\u2013249. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39998-5_15"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1134\/S0081543816060080","volume":"294","author":"SL Kuznetsov","year":"2016","unstructured":"Kuznetsov, S.L.: On translating Lambek grammars with one division into context-free grammars. Proc. Steklov Inst. Math. 294(1), 129\u2013138 (2016)","journal-title":"Proc. Steklov Inst. Math."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S., Okhotin, A.: Conjunctive categorial grammars. In: Proceedings of Mathematics of Language (2017)","DOI":"10.18653\/v1\/W17-3414"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1080\/00029890.1958.11989160","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. Amer. Math. Monthly 65, 154\u2013170 (1958)","journal-title":"Amer. Math. Monthly"},{"key":"22_CR18","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. Logic 56, 239\u2013311 (1992)","journal-title":"Ann. Pure Appl. Logic"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31555-8","volume-title":"The Logic of Categorial Grammars. A Deductive Account of Natural Language Syntax and Semantics","author":"R Moot","year":"2012","unstructured":"Moot, R., Retor\u00e9, C.: The Logic of Categorial Grammars. A Deductive Account of Natural Language Syntax and Semantics. LNCS, vol. 6850. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31555-8"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Morrill, G.V.: Categorial Grammar: Logical Syntax, Semantics, and Processing. Oxford University Press (2011)","DOI":"10.1093\/oxfordhb\/9780199544004.013.0004"},{"issue":"4","key":"22_CR21","first-page":"519","volume":"6","author":"A Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. J. Autom. Lang. Combin. 6(4), 519\u2013535 (2001)","journal-title":"J. Autom. Lang. Combin."},{"issue":"2","key":"22_CR22","doi-asserted-by":"crossref","first-page":"135","DOI":"10.3233\/FI-1980-3203","volume":"3","author":"G P\u0103un","year":"1980","unstructured":"P\u0103un, G.: A note on the intersection of context-free languages. Fundam. Inform. 3(2), 135\u2013139 (1980)","journal-title":"Fundam. Inform."},{"key":"22_CR23","unstructured":"Pentus, M.: Lambek grammars are context-free. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science (LICS 1993), pp. 429\u2013433. IEEE Computer Society Press (1993)"},{"issue":"1\u20133","key":"22_CR24","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(1\u20133), 186\u2013201 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20134","key":"22_CR25","first-page":"441","volume":"36","author":"M Pentus","year":"2010","unstructured":"Pentus, M.: A polynomial-time algorithm for Lambek grammars of bounded order. Linguist. Anal. 36(1\u20134), 441\u2013471 (2010)","journal-title":"Linguist. Anal."},{"issue":"4","key":"22_CR26","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s00224-009-9208-4","volume":"46","author":"Yu Savateev","year":"2010","unstructured":"Savateev, Yu.: Unidirectional Lambek grammars in polynomial time. Theory Comput. Syst. 46(4), 662\u2013672 (2010)","journal-title":"Theory Comput. Syst."},{"issue":"7","key":"22_CR27","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.apal.2011.09.017","volume":"163","author":"Yu Savateev","year":"2012","unstructured":"Savateev, Yu.: Product-free Lambek calculus is NP-complete. Ann. Pure Appl. Logic 163(7), 775\u2013788 (2012)","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T18:04:09Z","timestamp":1694973849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}