{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:31:44Z","timestamp":1775097104465,"version":"3.50.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100011051","name":"Council on grants of the President of the Russian Federation","doi-asserted-by":"publisher","award":["MK-430.2019.1"],"award-info":[{"award-number":["MK-430.2019.1"]}],"id":[{"id":"10.13039\/501100011051","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"\u0420\u043e\u0441\u0441\u0438\u0439\u0441\u043a\u0438\u0439 \u0424\u043e\u043d\u0434 \u0424\u0443\u043d\u0434\u0430\u043c\u0435\u043d\u0442\u0430\u043b\u044c\u043d\u044b\u0445 \u0418\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u043d\u0438\u0439","doi-asserted-by":"publisher","award":["20-01-00435"],"award-info":[{"award-number":["20-01-00435"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Russian Academic Excellence Project \u20195-100\u2019, HSE University","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]},{"name":"Young Russian Mathematics Award","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/R006865\/1"],"award-info":[{"award-number":["EP\/R006865\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10849-020-09320-9","type":"journal-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T13:05:53Z","timestamp":1603285553000},"page":"31-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities"],"prefix":"10.1007","volume":"30","author":[{"given":"Max","family":"Kanovich","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0025-0133","authenticated-orcid":false,"given":"Stepan","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,21]]},"reference":[{"key":"9320_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/malq.19900360103","volume":"36","author":"VM Abrusci","year":"1990","unstructured":"Abrusci, V. M. (1990). A comparison between Lambek syntactic calculus and intuitionistic linear logic. Zeitschr. math. Logik Grundl. Math. (Math. Logic Q.), 36, 11\u201315.","journal-title":"Zeitschr. math. Logik Grundl. Math. (Math. Logic Q.)"},{"key":"9320_CR2","first-page":"1","volume":"1","author":"K Ajdukiewicz","year":"1935","unstructured":"Ajdukiewicz, K. (1935). Die syntaktische Konnexit\u00e4t. Studia Philosophica, 1, 1\u201327.","journal-title":"Studia Philosophica"},{"issue":"3","key":"9320_CR3","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. (1992). Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3), 297\u2013347.","journal-title":"Journal of Logic and Computation"},{"key":"9320_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.2307\/410452","volume":"29","author":"Y Bar-Hillel","year":"1953","unstructured":"Bar-Hillel, Y. (1953). A quasi-arithmetical notation for syntactic description. Language, 29, 47\u201358.","journal-title":"Language"},{"key":"9320_CR5","first-page":"1","volume":"9F","author":"Y Bar-Hillel","year":"1960","unstructured":"Bar-Hillel, Y., Gaifman, C., & Shamir, E. (1960). On the categorial and phrase-structure grammars. Bulletin of the Research Council of Israel, 9F, 1\u201316.","journal-title":"Bulletin of the Research Council of Israel"},{"key":"9320_CR6","doi-asserted-by":"crossref","unstructured":"Bra\u00fcner, T. & de Paiva, V. (1996). Cut elimination for full intuitionistic linear logic. BRICS Report RS-96-10.","DOI":"10.7146\/brics.v3i10.19973"},{"key":"9320_CR7","doi-asserted-by":"crossref","unstructured":"Bra\u00fcner, T. & de\u00a0Paiva, V. (1998). A formulation of linear logic based on dependency relations. In M. Nielsen & W. Thomas (Ed.), CSL 1997: Computer Science Logic volume 1414 of LNCS (pp. 129\u2013148). Berlin: Springer.","DOI":"10.1007\/BFb0028011"},{"issue":"5","key":"9320_CR8","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1093\/jigpal\/8.5.629","volume":"8","author":"T Bra\u00fcner","year":"2000","unstructured":"Bra\u00fcner, T. (2000). A cut-free Gentzen formulation of the modal logic S5. Logic Journal of IGPL, 8(5), 629\u2013643.","journal-title":"Logic Journal of IGPL"},{"key":"9320_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1002\/malq.19820283308","volume":"28","author":"W Buszkowski","year":"1982","unstructured":"Buszkowski, W. (1982). Some decision problems in the theory of syntactic categories. Zeitschr. Math. Logik Grundl. Math. (Math. Logic Q.), 28, 539\u2013548.","journal-title":"Zeitschr. Math. Logik Grundl. Math. (Math. Logic Q.)"},{"key":"9320_CR10","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1002\/malq.19850312402","volume":"31","author":"W Buszkowski","year":"1985","unstructured":"Buszkowski, W. (1985). The equivalence of unidirectional lambek categorial grammars and context-free grammars. Zeitschr. Math. Logik Grundl. Math. (Math. Logic Q.), 31, 369\u2013384.","journal-title":"Zeitschr. Math. Logik Grundl. Math. (Math. Logic Q.)"},{"key":"9320_CR11","doi-asserted-by":"crossref","unstructured":"Buszkowski, W. (2003). Type logics in grammar. In Trends in Logic: 50 Years of Studia Logica (pp. 337\u2013382). Berlin: Springer.","DOI":"10.1007\/978-94-017-3598-8_12"},{"key":"9320_CR12","unstructured":"Buszkowski, W. (2005). Lambek calculus with nonlogical axioms. In Language and Grammar, volume 168 of CSLI Lecture Notes (pp. 77\u201393). CSLI."},{"key":"9320_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11225-008-9116-7","volume":"89","author":"W Buszkowski","year":"2008","unstructured":"Buszkowski, W., & Palka, E. (2008). Infinitary action logic: complexity, models and grammars. Studia Logica, 89, 1\u201318.","journal-title":"Studia Logica"},{"key":"9320_CR14","volume-title":"Type-logical semantics","author":"B Carpenter","year":"1997","unstructured":"Carpenter, B. (1997). Type-logical semantics. Cambridge: MIT Press."},{"issue":"3","key":"9320_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TIT.1956.1056813","volume":"I T\u20132","author":"N Chomsky","year":"1956","unstructured":"Chomsky, N. (1956). Three models for the description of language. IEEE Transactions on Information Theory, I T\u20132(3), 113\u2013124.","journal-title":"IEEE Transactions on Information Theory"},{"key":"9320_CR16","doi-asserted-by":"crossref","unstructured":"Dekhtyar, M. & Dikovsky, A. (2008). Generalized categorial dependency grammars. In A. Avron, N. Dershowitz, & A. Rabinovich (Ed.), Pillars of Computer Science: Trakhtenbrot\/Festschrift volume 4800 of LNCS (pp. 230\u2013255). Berlin: Springer.","DOI":"10.1007\/978-3-540-78127-1_13"},{"issue":"1","key":"9320_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1093\/logcom\/exaa006","volume":"30","author":"H Eades III","year":"2020","unstructured":"Eades, H, I. I. I., & de Paiva, V. (2020). Multiple conclusion linear logic: cut elimination and more. Journal of Logic and Computation, 30(1), 157\u2013174.","journal-title":"Journal of Logic and Computation"},{"key":"9320_CR18","unstructured":"Fadda, M., & Morrill, G. (2005). The Lambek calculus with brackets. In C. Casadio, P. J. Scott, & R. A. Seely (Eds.), Language and grammar: Studies in mathematical linguistics and natural language (pp. 113\u2013128). Stanford, CA: CSLI Publications."},{"key":"9320_CR19","unstructured":"Fofanova, E. M. (2018). Algorithmic decidability of a fragment of the Lambek calculus with an exponential modality. In Mal\u2019tsev meeting 2018, collection of abstracts. Sobolev Institute of Mathematics and Novosibirsk State University (in Russian)."},{"key":"9320_CR20","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G Gentzen","year":"1935","unstructured":"Gentzen, G. (1935). Untersuchungen \u00fcber das logische Schlie\u00dfen I. Mathematische Zeitschrift, 39, 176\u2013210.","journal-title":"Mathematische Zeitschrift"},{"issue":"1","key":"9320_CR21","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. (1987). Linear logic. Theoretical Computer Science, 50(1), 1\u2013102.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9320_CR22","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/S0960129500001328","volume":"1","author":"J-Y Girard","year":"1991","unstructured":"Girard, J.-Y. (1991). A new constructive logic: Classical logic. Mathematical Structures in Computer Science, 1(3), 255\u2013296.","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3","key":"9320_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0168-0072(93)90093-S","volume":"59","author":"J-Y Girard","year":"1993","unstructured":"Girard, J.-Y. (1993). On the unity of logic. Annals of Pure and Applied Logic, 59(3), 201\u2013217.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"9320_CR24","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"SA Greibach","year":"1965","unstructured":"Greibach, S. A. (1965). A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM, 12(1), 42\u201352.","journal-title":"Journal of the ACM"},{"issue":"2","key":"9320_CR25","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J Hodas","year":"1994","unstructured":"Hodas, J., & Miller, D. (1994). Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2), 327\u2013365.","journal-title":"Information and Computation"},{"issue":"1\u20132","key":"9320_CR26","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1023\/A:1024512212054","volume":"1","author":"G J\u00e4ger","year":"2003","unstructured":"J\u00e4ger, G. (2003). On the generative capacity of multi-modal categorial grammars. Research on Language and Computation, 1(1\u20132), 105\u2013125.","journal-title":"Research on Language and Computation"},{"issue":"2","key":"9320_CR27","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":"9320_CR28","unstructured":"Kanazawa, M. (1999). Lambek calculus: Recognizing power and complexity. In JFAK. Essays dedicated to Johan van Benthem to the occasion of his 50th birthday. Vossiuspers, Amsterdam University Press."},{"issue":"4","key":"9320_CR29","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10849-018-9269-3","volume":"27","author":"M Kanazawa","year":"2018","unstructured":"Kanazawa, M. (2018). On the recognizing power of the Lambek calculus with brackets. Journal of Logic, Language and Information, 27(4), 295\u2013312.","journal-title":"Journal of Logic, Language and Information"},{"key":"9320_CR30","unstructured":"Kanovich, M. (1994). Horn fragments of non-commutative logics with additives are PSPACE-complete. Extended abstract, presented at CSL \u201994, Kazimierz, Poland."},{"key":"9320_CR31","unstructured":"Kanovich, M., Kuznetsov, S., Morrill, G., & Scedrov, A. (2017a). A polynomial-time algorithm for the Lambek calculus with brackets of bounded order. In D. Miller (Ed.), 2nd international conference on formal structures for computation and deduction (FSCD 2017), volume\u00a084 of Leibniz international proceedings in informatics (LIPIcs), (pp. 22:1\u201322:17). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik."},{"key":"9320_CR32","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kuznetsov, S., Nigam, V., & Scedrov, A. (2018). A logical framework with commutative and non-commutative subexponentials. In IJCAR 2018: Automated Reasoning, volume 10900 of LNAI (pp. 228\u2013245). Berlin: Springer.","DOI":"10.1007\/978-3-319-94205-6_16"},{"key":"9320_CR33","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kuznetsov, S., Nigam, V., & Scedrov, A. (2019a). Subexponentials in non-commutative linear logic. Math. Struct. Comput. Sci., 29(8), 1217\u20131249.","DOI":"10.1017\/S0960129518000117"},{"key":"9320_CR34","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kuznetsov, S., & Scedrov, A. (2016a). On Lambek\u2019s restriction in the presence of exponential modalities. In S. Artemov & A. Nerode, (Ed.), Proceedings of LFCS 2016 volume 9537 of LNCS, (pp. 146\u2013158). Berlin: Springer.","DOI":"10.1007\/978-3-319-27683-0_11"},{"key":"9320_CR35","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kuznetsov, S., & Scedrov, A. (2016b). Undecidability of the Lambek calculus with a relevant modality. In A. Foret, G. Morrill, R. Muskens, R. Osswald, & S. Pogodalla (Ed.), FG 2015, FG 2016: Formal Grammar volume 9804 of LNCS (pp. 240\u2013256). Berlin: Springer.","DOI":"10.1007\/978-3-662-53042-9_14"},{"key":"9320_CR36","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kuznetsov, S., & Scedrov, A. (2017b). Undecidability of the Lambek calculus with subexponential and bracket modalities. In R. Klasing & M. Zeitoun (Ed.), FCT 2017: Fundamentals of computation theory volume 10472 of LNCS (pp. 326\u2013340). Berlin: Springer.","DOI":"10.1007\/978-3-662-55751-8_26"},{"key":"9320_CR37","doi-asserted-by":"crossref","unstructured":"Kanovich, M., Kuznetsov, S., & Scedrov, A. (2019b). Undecidability of a newly proposed calculus for CatLog3. In R. Bernardi, G. Kobele, & S. Pogodalla (Ed.), FG 2019: Formal grammar, volume 11668 of LNCS (pp. 67\u201383). Berlin: Springer.","DOI":"10.1007\/978-3-662-59648-7_5"},{"issue":"1","key":"9320_CR38","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1093\/logcom\/exaa010","volume":"30","author":"M Kanovich","year":"2020","unstructured":"Kanovich, M., Kuznetsov, S., & Scedrov, A. (2020). Reconciling Lambek\u2019s restriction, cut-elimination, and substitution in the presence of exponential modalities. Journal of Logic and Computation, 30(1), 239\u2013256.","journal-title":"Journal of Logic and Computation"},{"key":"9320_CR39","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1006\/inco.2001.2960","volume":"179","author":"D Kozen","year":"2002","unstructured":"Kozen, D. (2002). On the complexity of reasoning in Kleene algebra. Information and Computation, 179, 152\u2013162.","journal-title":"Information and Computation"},{"key":"9320_CR40","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S. (2012a). Lambek grammars with one division and one primitive type. Log. J. IGPL, 20(1), 207\u2013221.","DOI":"10.1093\/jigpal\/jzr031"},{"key":"9320_CR41","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S. (2012b). Lambek grammars with the unit. In P. de\u00a0Groote & M.-J. Nederhof (Ed.), FG 2010, FG 2011: Formal Grammar volume 7395 of LNCS (pp. 262\u2013266). Berlin: Springer.","DOI":"10.1007\/978-3-642-32024-8_17"},{"key":"9320_CR42","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S. (2013). Conjunctive grammars in Greibach normal form and the Lambek calculus with additive connectives. In G. Morrill & M.-J. Nederhof, (Ed.), FG 2013, FG 2012: Formal Grammar volume 8036 of LNCS (pp. 242\u2013249). Berlin: Springer.","DOI":"10.1007\/978-3-642-39998-5_15"},{"key":"9320_CR43","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1134\/S0081543816060080","volume":"294","author":"SL Kuznetsov","year":"2016","unstructured":"Kuznetsov, S. L. (2016). On translating Lambek grammars with one division into context-free grammars. Proceedings of the Steklov Institute of Mathematics, 294, 129\u2013138.","journal-title":"Proceedings of the Steklov Institute of Mathematics"},{"key":"9320_CR44","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S. (2017). The Lambek calculus with iteration: two variants. In J. Kennedy & R.\u00a0J. G.\u00a0B. de\u00a0Queiroz (Ed.), WoLLIC 2017: Logic, language, information, and computation volume 10388 of LNCS (pp. 182\u2013198). Berlin: Springer.","DOI":"10.1007\/978-3-662-55386-2_13"},{"key":"9320_CR45","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S. (2019). The logic of action lattices is undecidable. In Proceedings of 34th annual ACM\/IEEE symposium on logic in computer science (LICS 2019). IEEE.","DOI":"10.1109\/LICS.2019.8785659"},{"key":"9320_CR46","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S. & Okhotin, A. (2017). Conjunctive categorial grammars. In Proceedings of MoL \u201917, volume W17-3414 of ACL Anthology (pp. 140\u2013151).","DOI":"10.18653\/v1\/W17-3414"},{"key":"9320_CR47","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. American Mathematical Monthly, 65, 154\u2013170.","journal-title":"American Mathematical Monthly"},{"issue":"1","key":"9320_CR48","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. (1992). Decision problems for propositional linear logic. Annals of Pure and Applied Logic, 56(1), 239\u2013311.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9320_CR49","first-page":"583","volume":"55","author":"A Markov","year":"1947","unstructured":"Markov, A. (1947). On the impossibility of certain algorithms in the theory of associative systems. Doklady Academy Science USSR (N. S.), 55, 583\u2013586.","journal-title":"Doklady Academy Science USSR (N. S.)"},{"issue":"3\u20134","key":"9320_CR50","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00159344","volume":"5","author":"M Moortgat","year":"1996","unstructured":"Moortgat, M. (1996). Multimodal linguistic inference. Journal of Logic, Language and Information, 5(3\u20134), 349\u2013385.","journal-title":"Journal of Logic, Language and Information"},{"key":"9320_CR51","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, volume 6850 of LNCS. Berlin: Springer.","DOI":"10.1007\/978-3-642-31555-8"},{"key":"9320_CR52","unstructured":"Morrill, G. & Valent\u00edn, O. (2015a). Computation coverage of TLG: Nonlinearity. In Proceeding of NLCS \u201915, volume\u00a032 of EPiC Series (pp. 51\u201363)."},{"key":"9320_CR53","doi-asserted-by":"crossref","unstructured":"Morrill, G. & Valent\u00edn, O. (2015b). Multiplicative-additive focusing for parsing as deduction. In First International Workshop on Focusing (affiliated with LPAR), Suva, Fiji, volume 197 of EPTCS (pp. 29\u201354).","DOI":"10.4204\/EPTCS.197.4"},{"key":"9320_CR54","unstructured":"Morrill, G. (1992). Categorial formalisation of relativisation: Pied piping, islands, and extraction sites. Technical Report LSI-92-23-R, Universitat Polit\u00e8cnica de Catalunya."},{"key":"9320_CR55","doi-asserted-by":"crossref","unstructured":"Morrill, G. (2014). A categorial type logic. In C. Casadio, B. Coecke, M. Moortgat, & P. Scott (Ed.), Categories and types in logic, language, and physics: Essays dedicated to J. Lambek on the occasion of his 90th birthday, LNCS (pp. 331\u2013352). Berlin: Springer.","DOI":"10.1007\/978-3-642-54789-8_18"},{"key":"9320_CR56","unstructured":"Morrill, G. (2017b). Parsing logical grammar: CatLog3. In Proceedings of LACompLing2017 (pp. 107\u2013131)."},{"key":"9320_CR57","unstructured":"Morrill, G. (2018a). The CatLog3 technical manual. Technical report, Universitat Polit\u00e8cnica de Catalunya. http:\/\/www.lsi.upc.edu\/~morrill\/CatLog3\/CatLog3.pdf. Accessed 7 Oct 2020."},{"key":"9320_CR58","doi-asserted-by":"crossref","unstructured":"Morrill, G., Kuznetsov, S., Kanovich, M., & Scedrov, A. (2018). Bracket induction for Lambek calculus with bracket modalities. In A. Foret, G. Kobele, & S. Pogodalla (Ed.), FG 2018: Formal Grammar, volume 10950 of LNCS, (pp. 84\u2013101). Berlin: Springer.","DOI":"10.1007\/978-3-662-57784-4_5"},{"key":"9320_CR59","volume-title":"Categorial grammar: Logical syntax, semantics, and processing","author":"GV Morrill","year":"2011","unstructured":"Morrill, G. V. (2011). Categorial grammar: Logical syntax, semantics, and processing. Oxford: Oxford University Press."},{"key":"9320_CR60","doi-asserted-by":"crossref","unstructured":"Morrill, G. (2017a). Grammar logicised: Relativisation. Linguistics and Philosophy, 40(2), 119\u2013163.","DOI":"10.1007\/s10988-016-9197-0"},{"key":"9320_CR61","doi-asserted-by":"crossref","unstructured":"Morrill, G. (2018b). A note on movement in logical grammar. Journal of Language Modelling, 6(2), 353\u2013363.","DOI":"10.15398\/jlm.v6i2.233"},{"key":"9320_CR62","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10849-018-09277-w","volume":"28","author":"G Morrill","year":"2019","unstructured":"Morrill, G. (2019). Parsing\/theorem-proving for logical grammar CatLog3. Journal of Logic, Language and Information, 28, 183\u2013216.","journal-title":"Journal of Logic, Language and Information"},{"issue":"1\u20134","key":"9320_CR63","first-page":"167","volume":"36","author":"G Morrill","year":"2010","unstructured":"Morrill, G., & Valent\u00edn, O. (2010). Displacement calculus. Linguistic Analysis, 36(1\u20134), 167\u2013192.","journal-title":"Linguistic Analysis"},{"key":"9320_CR64","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2013.06.001","volume":"9","author":"A Okhotin","year":"2013","unstructured":"Okhotin, A. (2013). Conjunctive and boolean grammars: The true general case of the context-free grammars. Computer Science Review, 9, 27\u201359.","journal-title":"Computer Science Review"},{"key":"9320_CR65","doi-asserted-by":"crossref","unstructured":"Pentus, M. (1993). Lambek grammars are context-free. In Proceedings LICS \u201993 (pp. 429\u2013433). IEEE.","DOI":"10.1109\/LICS.1993.287565"},{"issue":"1","key":"9320_CR66","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. (2006). Lambek calculus is NP-complete. Theoretical Computer Science, 357(1), 186\u2013201.","journal-title":"Theoretical Computer Science"},{"key":"9320_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2267170","volume":"12","author":"EL Post","year":"1947","unstructured":"Post, E. L. (1947). Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic, 12, 1\u201311.","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"9320_CR68","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/BF00360802","volume":"4","author":"GK Pullum","year":"1982","unstructured":"Pullum, G. K., & Gazdar, G. (1982). Natural languages and context-free languages. Linguistics and Philosophy, 4(4), 471\u2013504.","journal-title":"Linguistics and Philosophy"},{"issue":"4","key":"9320_CR69","doi-asserted-by":"publisher","first-page":"168","DOI":"10.3103\/S0027132207040092","volume":"62","author":"AN Safiullin","year":"2007","unstructured":"Safiullin, A. N. (2007). Derivability of admissible rules with simple premises in the Lambek calculus. Moscow University Mathematics Bulletin, 62(4), 168\u2013171.","journal-title":"Moscow University Mathematics Bulletin"},{"issue":"4","key":"9320_CR70","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s00224-009-9208-4","volume":"46","author":"Y Savateev","year":"2010","unstructured":"Savateev, Y. (2010). Unidirectional Lambek grammars in polynomial time. Theory Computing Systems, 46(4), 662\u2013672.","journal-title":"Theory Computing Systems"},{"key":"9320_CR71","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF00630917","volume":"8","author":"SM Shieber","year":"1985","unstructured":"Shieber, S. M. (1985). Evidence against the context-freeness of natural languages. Linguistics and Philosophy, 8, 333\u2013343.","journal-title":"Linguistics and Philosophy"},{"key":"9320_CR72","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6591.001.0001","volume-title":"The syntactic process","author":"M Steedman","year":"2000","unstructured":"Steedman, M. (2000). The syntactic process. Cambridge: MIT Press."},{"key":"9320_CR73","unstructured":"Thue, A. (1914). Probleme \u00fcber Ver\u00e4nderungen von Zeichenreihen nach gegebener Regeln (p. 10). Vidensk. Selsk. Skrifter.: Kra."},{"key":"9320_CR74","unstructured":"Versmissen, K. (1996). Grammatical composition: Modes, models, modalities. Ph.D. thesis, OTS Utrecht."}],"updated-by":[{"DOI":"10.1007\/s10849-020-09323-6","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000}}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-020-09320-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10849-020-09320-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-020-09320-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T05:52:39Z","timestamp":1723787559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10849-020-09320-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,21]]},"references-count":74,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["9320"],"URL":"https:\/\/doi.org\/10.1007\/s10849-020-09320-9","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10849-020-09323-6","asserted-by":"object"}]},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"value":"0925-8531","type":"print"},{"value":"1572-9583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,21]]},"assertion":[{"value":"29 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2020","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10849-020-09323-6","URL":"https:\/\/doi.org\/10.1007\/s10849-020-09323-6","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}