{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T07:17:22Z","timestamp":1763623042834,"version":"3.45.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10849-025-09441-z","type":"journal-article","created":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T05:35:06Z","timestamp":1759124106000},"page":"463-514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proof-Theoretic Aspects of the Logic of Scope"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6450-1600","authenticated-orcid":false,"given":"Richard","family":"Moot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,29]]},"reference":[{"key":"9441_CR1","volume-title":"The Lambda Calculus: Its Syntax and Semantics, Studies in Logic and The Foundations of Mathematics","author":"H Barendregt","year":"1981","unstructured":"Barendregt, H. (1981). The Lambda Calculus: Its Syntax and Semantics, Studies in Logic and The Foundations of Mathematics (revised, 1984, Vol. 103). Elsevier.","edition":"revised, 1984"},{"issue":"2","key":"9441_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10849-019-09288-1","volume":"28","author":"C Barker","year":"2019","unstructured":"Barker, C. (2019). $$\\text{ nl}_{\\lambda }$$ as the logic of scope and movement. Journal of Logic, Language and Information, 28(2), 217\u2013237.","journal-title":"Journal of Logic, Language and Information"},{"key":"9441_CR3","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199575015.001.0001","volume-title":"Continuations and Natural Language. Oxford Studies in Theoretical Linguistics","author":"C Barker","year":"2014","unstructured":"Barker, C., & Shan, C. (2014). Continuations and Natural Language. Oxford Studies in Theoretical Linguistics. Oxford University Press."},{"key":"9441_CR4","unstructured":"Becker, T. (1994). HyTAG: A new type of tree adjoining grammars for hybrid syntactic representation of free word order languages. PhD thesis, Saarland University, Saarbr\u00fccken."},{"key":"9441_CR5","unstructured":"Becker, T., Rambow, O., & Niv, M. (1992). The derivational generative power of formal systems or scrambling is beyond LCFRS. Tech. Rep.\u00a038, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia."},{"key":"9441_CR6","doi-asserted-by":"crossref","unstructured":"Boullier, P. (1999). Chinese numbers, MIX, scrambling and range concatenation grammars. In Proceedings of the European Association of Computational Linguistics EACL\u201999.","DOI":"10.3115\/977035.977044"},{"key":"9441_CR7","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/B978-044481714-3\/50016-3","volume-title":"Handbook of Logic and Language","author":"W Buszkowski","year":"1997","unstructured":"Buszkowski, W. (1997). Mathematical linguistics and proof theory. In J. van Benthem & A. ter Meulen (Eds.), Handbook of Logic and Language (pp. 683\u2013736). North-Holland Elsevier, Amsterdam. chap\u00a012."},{"key":"9441_CR8","unstructured":"de\u00a0Groote, P., & Retor\u00e9, C. (1996). On the semantic readings of proof nets. In: Kruijff, G. J., Morrill, G., Oehrle, R. T. (eds) Formal Grammar, (pp 57\u201370)"},{"key":"9441_CR9","unstructured":"Emms, M. (1993). Extraction covering extensions of the Lambek calculus are not context free. In Dekker, P., Stokhof, M. (eds) Proceedings 9th Amsterdam Colloquium, (pp 268\u2013286)."},{"key":"9441_CR10","first-page":"107","volume-title":"Proceedings of Formal Grammar 1995","author":"P Hendriks","year":"1995","unstructured":"Hendriks, P. (1995). Ellipsis and multimodal categorial type logic. In G. Morrill & R. T. Oehrle (Eds.), Proceedings of Formal Grammar 1995 (pp. 107\u2013122). Spain: Barcelona."},{"key":"9441_CR11","volume-title":"Introduction to Automata Theory","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J. E., & Ullman, J. D. (1979). Introduction to Automata Theory. Addison-Wesley, Reading, Massachussets: Languages and Computation."},{"key":"9441_CR12","first-page":"31","volume-title":"Foundational Issues in Natural Language Processing","author":"A Joshi","year":"1991","unstructured":"Joshi, A., Shanker, V., & Weir, D. (1991). The convergence of mildly context-sensitive grammar formalisms. In P. Sells, S. Shieber, & T. Wasow (Eds.), Foundational Issues in Natural Language Processing (pp. 31\u201382). Cambridge, Massachusetts: MIT Press."},{"key":"9441_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14846-0","volume-title":"Parsing Beyond Context-Free Grammars","author":"L Kallmeyer","year":"2010","unstructured":"Kallmeyer, L. (2010). Parsing Beyond Context-Free Grammars. Springer."},{"key":"9441_CR14","unstructured":"Kanazawa, M., & Salvati, S. (2012). Mix is not a tree-adjoining language. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics."},{"key":"9441_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-31262-5_9","volume-title":"Logical Aspects of Computational Linguistics","author":"Y Kubota","year":"2012","unstructured":"Kubota, Y., & Levine, R. (2012). Gapping as like-category coordination. Lecture Notes in Computer ScienceIn D. B\u00e9chet & A. Dikovsky (Eds.), Logical Aspects of Computational Linguistics (Vol. 7351, pp. 135\u2013150). Nantes: Springer."},{"key":"9441_CR16","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/11866.001.0001","volume-title":"Type-Logical Syntax","author":"Y Kubota","year":"2020","unstructured":"Kubota, Y., & Levine, R. (2020). Type-Logical Syntax. MIT Press."},{"key":"9441_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/B978-044481714-3\/50005-9","volume-title":"Handbook of Logic and Language","author":"M Moortgat","year":"1997","unstructured":"Moortgat, M. (1997). Categorial type logics. In J. van Benthem & A. ter Meulen (Eds.), Handbook of Logic and Language (pp. 93\u2013177). Elsevier\/MIT Press. chap\u00a02."},{"key":"9441_CR18","first-page":"283","volume-title":"Quantum Physics and Linguistics: A Compositional","author":"M Moortgat","year":"2013","unstructured":"Moortgat, M., & Moot, R. (2013). Proof nets for the lambek-grishin calculus. In E. Grefenstette, C. Heunen, & M. Sadrzadeh (Eds.), Quantum Physics and Linguistics: A Compositional (pp. 283\u2013320). Diagrammatic Discourse: Oxford University Press."},{"issue":"3","key":"9441_CR19","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1023\/A:1020525032763","volume":"71","author":"R Moot","year":"2002","unstructured":"Moot, R., & Puite, Q. (2002). Proof nets for the multimodal lambek calculus. Studia Logica, 71(3), 415\u2013442.","journal-title":"Studia Logica"},{"key":"9441_CR20","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10849-019-09290-7","volume":"28","author":"R Moot","year":"2019","unstructured":"Moot, R., & Retor\u00e9, C. (2019). Natural language semantics and computability. Journal of Logic, Language and Information, 28, 287\u2013307.","journal-title":"Journal of Logic, Language and Information"},{"issue":"1","key":"9441_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10849-021-09348-5","volume":"31","author":"R Moot","year":"2022","unstructured":"Moot, R., & Stevens-Guille, S. J. (2022). Logical foundations for hybrid type-logical grammars. Journal of Logic, Language and Information, 31(1), 35\u201376.","journal-title":"Journal of Logic, Language and Information"},{"key":"9441_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1042-6","volume-title":"Type Logical Grammar","author":"G Morrill","year":"1994","unstructured":"Morrill, G. (1994). Type Logical Grammar. Dordrecht: Kluwer Academic Publishers."},{"key":"9441_CR23","doi-asserted-by":"crossref","unstructured":"Morrill, G. (1999). Geometry of lexico-syntactic interaction. In Proceedings of the Ninth Conference of the European Chapter of the Association for Computational Linguistics, Bergen, Norway, (pp 61\u201370).","DOI":"10.3115\/977035.977045"},{"issue":"1","key":"9441_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10849-010-9129-2","volume":"20","author":"G Morrill","year":"2011","unstructured":"Morrill, G., Valent\u00edn, O., & Fadda, M. (2011). The displacement calculus. Journal of Logic, Language and Information, 20(1), 1\u201348.","journal-title":"Journal of Logic, Language and Information"},{"key":"9441_CR25","doi-asserted-by":"crossref","unstructured":"Nederhof, M. J. (2016). A short proof that $$o\\_2$$ is an MCFL. Tech. rep., arXiv","DOI":"10.18653\/v1\/P16-1106"},{"issue":"6","key":"9441_CR26","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/BF00985321","volume":"17","author":"RT Oehrle","year":"1994","unstructured":"Oehrle, R. T. (1994). Term-labeled categorial type systems. Linguistics & Philosophy, 17(6), 633\u2013678.","journal-title":"Linguistics & Philosophy"},{"key":"9441_CR27","doi-asserted-by":"publisher","first-page":"648","DOI":"10.2307\/2275553","volume":"62","author":"M Pentus","year":"1997","unstructured":"Pentus, M. (1997). Product-free lambek calculus and context-free grammars. Journal of Symbolic Logic, 62, 648\u2013660.","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"9441_CR28","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":"9441_CR29","unstructured":"Rambow, O. (1994). Formal and computational aspects of natural language syntax. PhD thesis, University of Pennsylvania."},{"issue":"7","key":"9441_CR30","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1016\/j.jcss.2015.03.004","volume":"81","author":"S Salvati","year":"2015","unstructured":"Salvati, S. (2015). Mix is a 2-mcfl and the word problem in z2 is captured by the io and the oi hierarchies. Journal of Computer and System Sciences, 81(7), 1252\u20131277.","journal-title":"Journal of Computer and System Sciences"},{"key":"9441_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., & Kasami, T. (1991). On multiple context-free grammars. Theoretical Computer Science, 88, 191\u2013229.","journal-title":"Theoretical Computer Science"},{"key":"9441_CR32","unstructured":"Troelstra, A. S. (1992). Lectures on Linear Logic. CSLI Lecture Notes 29, Center for the Study of Language and Information, Stanford, California"},{"key":"9441_CR33","doi-asserted-by":"crossref","unstructured":"Weir, D. J., Vijay-Shanker, K., & Joshi, A. K. (1986). The relationship between tree adjoining grammars and head grammars. In Proceedings of the 24th Meeting of the Association for Computational Linguistics.","DOI":"10.3115\/981131.981142"}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-025-09441-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10849-025-09441-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-025-09441-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T07:13:34Z","timestamp":1763622814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10849-025-09441-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["9441"],"URL":"https:\/\/doi.org\/10.1007\/s10849-025-09441-z","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"type":"print","value":"0925-8531"},{"type":"electronic","value":"1572-9583"}],"subject":[],"published":{"date-parts":[[2025,9,29]]},"assertion":[{"value":"5 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}