{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:30Z","timestamp":1740122490907,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["20-01-00670"],"award-info":[{"award-number":["20-01-00670"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012708","name":"Foundation for the Advancement of Theoretical Physics and Mathematics","doi-asserted-by":"publisher","award":["21-7-2-7-2"],"award-info":[{"award-number":["21-7-2-7-2"]}],"id":[{"id":"10.13039\/501100012708","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Interdisciplinary Scientific and Educational School of Moscow University \u201cBrain, Cognitive Systems, Artificial Intelligence\u201d"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10849-023-09407-z","type":"journal-article","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T04:13:47Z","timestamp":1698639227000},"page":"887-936","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Commutative Lambek Grammars"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4779-3143","authenticated-orcid":false,"given":"Tikhon","family":"Pshenitsyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,30]]},"reference":[{"key":"9407_CR1","first-page":"1","volume":"9","author":"Y Bar-Hillel","year":"1960","unstructured":"Bar-Hillel, Y., Gaifman, C., & Shamir, E. (1960). On categorial and phrase structure grammars. Bulletin of the Research Council of Israel, 9, 1\u20136.","journal-title":"Bulletin of the Research Council of Israel"},{"key":"9407_CR2","doi-asserted-by":"publisher","unstructured":"Buszkowski, W. (2021). In Loukanova, R. (Ed.) Lambek Calculus with Classical Logic (pp. 1\u201336). Springer. https:\/\/doi.org\/10.1007\/978-3-030-63787-3_1","DOI":"10.1007\/978-3-030-63787-3_1"},{"issue":"1","key":"9407_CR3","first-page":"31","volume":"13","author":"W Buszkowski","year":"1984","unstructured":"Buszkowski, W. (1984). A note on the Lambek-van Benthem calculus. Bulletin of the Section of Logic, 13(1), 31\u201335.","journal-title":"Bulletin of the Section of Logic"},{"key":"9407_CR4","doi-asserted-by":"publisher","unstructured":"de Groote, P., Guillaume, B., & Salvati, S. (2004). Vector addition tree automata. In Proceedings of the 19th annual IEEE symposium on logic in computer science (pp. 64\u201373). https:\/\/doi.org\/10.1109\/LICS.2004.1319601","DOI":"10.1109\/LICS.2004.1319601"},{"issue":"2","key":"9407_CR5","first-page":"333","volume":"113","author":"S Ginsburg","year":"1964","unstructured":"Ginsburg, S., & Spanier, E. H. (1964). Bounded ALGOL-like languages. Transactions of the American Mathematical Society, 113(2), 333\u2013368.","journal-title":"Transactions of the American Mathematical Society"},{"issue":"2","key":"9407_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"Seymour Ginsburg","year":"1966","unstructured":"Ginsburg, Seymour, & Spanier, Edwin H. (1966). Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics, 16(2), 285\u2013296.","journal-title":"Pacific Journal of Mathematics"},{"issue":"3","key":"9407_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(77)90103-0","volume":"19","author":"J Goldstine","year":"1977","unstructured":"Goldstine, J. (1977). A simplified proof of Parikh\u2019s theorem. Discrete Mathematics, 19(3), 235\u2013239. https:\/\/doi.org\/10.1016\/0012-365X(77)90103-0","journal-title":"Discrete Mathematics"},{"issue":"3","key":"9407_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0168-0072(93)90146-5","volume":"64","author":"M Hyland","year":"1993","unstructured":"Hyland, M., & de Paiva, V. (1993). Full intuitionistic linear logic. Annals of Pure and Applied Logic, 64(3), 273\u2013291. https:\/\/doi.org\/10.1016\/0168-0072(93)90146-5","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2","key":"9407_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00171695","volume":"1","author":"M Kanazawa","year":"1992","unstructured":"Kanazawa, M. (1992). The Lambek calculus enriched with additional connectives. Journal of Logic, Language and Information, 1(2), 141\u2013171.","journal-title":"Journal of Logic, Language and Information"},{"key":"9407_CR10","doi-asserted-by":"publisher","unstructured":"Kanovich, M. I., Kuznetsov, S. L., & Scedrov, A. (2019). The complexity of multiplicative-additive lambek calculus: 25 years later. In Iemhoff, R., Moortgat, M., & de Queiroz, R.J.G.B. (Eds.) WoLLIC 2019, Utrecht, The Netherlands, Proceedings. Lecture Notes in Computer Science (Vol. 11541, pp. 356\u2013372). Springer. https:\/\/doi.org\/10.1007\/978-3-662-59533-6_22","DOI":"10.1007\/978-3-662-59533-6_22"},{"issue":"2","key":"9407_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R. M., & Miller, R. E. (1969). Parallel program schemata. Journal of Computer and System Sciences, 3(2), 147\u2013195. https:\/\/doi.org\/10.1016\/S0022-0000(69)80011-5","journal-title":"Journal of Computer and System Sciences"},{"key":"9407_CR12","unstructured":"Kuznetsov, Stepan L. (2021). Personal communication."},{"issue":"3","key":"9407_CR13","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1080\/00029890.1958.11989160","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J. (1958). The mathematics of sentence structure. The American Mathematical Monthly, 65(3), 154\u2013170.","journal-title":"The American Mathematical Monthly"},{"issue":"1\u20132","key":"9407_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0168-0072(94)00060-G","volume":"75","author":"I Max","year":"1995","unstructured":"Max, I. (1995). Kanovich: Petri nets, Horn programs, linear logic and vector games. Annals of Pure and Applied Logic, 75(1\u20132), 107\u2013135. https:\/\/doi.org\/10.1016\/0168-0072(94)00060-G","journal-title":"Annals of Pure and Applied Logic"},{"key":"9407_CR15","doi-asserted-by":"crossref","unstructured":"Moot, R., & Retor\u00e9, C. (2012). The Logic of Categorial Grammars - A Deductive Account of Natural Language Syntax and Semantics. Lecture Notes in Computer Science (Vol. 6850). Springer.","DOI":"10.1007\/978-3-642-31555-8"},{"key":"9407_CR16","first-page":"199","volume":"60","author":"RJ Parikh","year":"1961","unstructured":"Parikh, R. J. (1961). Language generating devices. Quarterly Progress Report, 60, 199\u2013212.","journal-title":"Quarterly Progress Report"},{"key":"9407_CR17","doi-asserted-by":"publisher","unstructured":"Pentus, M. (1993). Lambek grammars are context free. In Proceedings of the 8th Annual Symposium on Logic in Computer Science (pp. 429\u2013433). IEEE Computer Society. https:\/\/doi.org\/10.1109\/LICS.1993.287565","DOI":"10.1109\/LICS.1993.287565"},{"key":"9407_CR18","doi-asserted-by":"publisher","unstructured":"Pshenitsyn, T. (2023). From double pushout grammars to hypergraph lambek grammars with and without exponential modality. In Grabmayer, C. (Ed.) Proceedings TERMGRAPH 2022, Technion, Haifa, Israel. EPTCS (Vol. 377, pp. 9\u201326). https:\/\/doi.org\/10.4204\/EPTCS.377.1","DOI":"10.4204\/EPTCS.377.1"},{"key":"9407_CR19","doi-asserted-by":"publisher","unstructured":"Rambow, O. (1994). Multiset-valued linear index grammars: Imposing dominance constraints on derivations. In ACL (pp. 263\u2013270). Morgan Kaufmann Publishers\/ACL. https:\/\/doi.org\/10.3115\/981732.981768","DOI":"10.3115\/981732.981768"},{"key":"9407_CR20","unstructured":"Valent\u00edn, Oriol (2012). Theory of discontinuous Lambek calculus. PhD thesis, Universitat Aut\u00f2noma de Barcelona. Departament de Filologia Catalana."},{"key":"9407_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1075\/llsee.25.06ben","volume":"25","author":"J van Benthem","year":"1983","unstructured":"van Benthem, J. (1983). The Semantics of Variety in Categorial Grammar. Linguistic and Literary Studies in Eastern Europe, 25, 37\u201355.","journal-title":"Linguistic and Literary Studies in Eastern Europe"},{"issue":"3","key":"9407_CR22","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00250539","volume":"20","author":"J van Benthem","year":"1991","unstructured":"van Benthem, J. (1991). Language in action. Journal of Philosophical Logic, 20(3), 225\u2013263. https:\/\/doi.org\/10.1007\/BF00250539","journal-title":"Journal of Philosophical Logic"},{"issue":"1","key":"9407_CR23","first-page":"217","volume":"7","author":"KN Verma","year":"2005","unstructured":"Verma, K. N. (2005). Jean Goubault\u2013Larrecq: Karp\u2013Miller trees for a branching extension of VASS. Discrete Mathematics and Theoretical Computer Science, 7(1), 217\u2013230.","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"1","key":"9407_CR24","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1305\/ndjfl\/1093634995","volume":"30","author":"D Wayne","year":"1988","unstructured":"Wayne, D. (1988). Blizard: Multiset theory. Notre Dame Journal of Formal Logic, 30(1), 36\u201366. https:\/\/doi.org\/10.1305\/ndjfl\/1093634995","journal-title":"Notre Dame Journal of Formal Logic"}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-023-09407-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10849-023-09407-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-023-09407-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T12:14:38Z","timestamp":1700828078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10849-023-09407-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,30]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9407"],"URL":"https:\/\/doi.org\/10.1007\/s10849-023-09407-z","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"type":"print","value":"0925-8531"},{"type":"electronic","value":"1572-9583"}],"subject":[],"published":{"date-parts":[[2023,10,30]]},"assertion":[{"value":"9 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}