{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:56:27Z","timestamp":1763643387427,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10849-021-09348-5","type":"journal-article","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T14:02:49Z","timestamp":1643032969000},"page":"35-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Logical Foundations for Hybrid Type-Logical Grammars"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6450-1600","authenticated-orcid":false,"given":"Richard","family":"Moot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Symon Jory","family":"Stevens-Guille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"9348_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J. A., & Murty, U. S. R. (2008). Graph theory, Graduate Texts in Mathematics, vol. 244. Springer.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"9348_CR2","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. Mathematical Logic Quarterly, 28, 539\u2013548.","journal-title":"Mathematical Logic Quarterly"},{"key":"9348_CR3","unstructured":"Danos, V. (1990). La logique lin\u00e9aire appliqu\u00e9e \u00e0 l\u2019\u00e9tude de divers processus de normalisation (principalement du $$\\lambda $$-calcul). Ph.D. thesis, University of Paris VII."},{"key":"9348_CR4","unstructured":"de Groote, P., & Retor\u00e9, C. (1996). On the semantic readings of proof nets. In G. J. Kruijff, G. Morrill, R. T. Oehrle (Eds.) Formal grammar, pp. 57\u201370."},{"key":"9348_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0304-3975(96)00121-1","volume":"169","author":"R Di Cosmo","year":"1996","unstructured":"Di Cosmo, R., & Kesner, D. (1996). Combining algebraic rewriting, extensional lambda calculi, and fixpoints. Theoretical Computer Science, 169, 201\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"9348_CR6","doi-asserted-by":"crossref","unstructured":"Emms, M. (1993). Parsing with polymorphism. In Proceedings of the sixth conference of the European association of computational linguistics, pp. 120\u2013129.","DOI":"10.3115\/976744.976760"},{"key":"9348_CR7","unstructured":"Emms, M. (1995). An undecidability result for polymorphic Lambek calculus. In Proceedings of the 10th Amsterdam colloquium."},{"key":"9348_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"JY Girard","year":"1987","unstructured":"Girard, J. Y. (1987). Linear logic. Theoretical Computer Science, 50, 1\u2013102.","journal-title":"Theoretical Computer Science"},{"key":"9348_CR9","unstructured":"Girard, J. Y., Lafont, Y., & Taylor, P. (1988). Proofs and types. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press."},{"key":"9348_CR10","doi-asserted-by":"crossref","unstructured":"Kanovich, M. I., Kuznetsov, S., & Scedrov, A. (2019). The complexity of multiplicative-additive lambek calculus: 25 years later. In R. Iemhoff, M. Moortgat, R. J. G. B. de\u00a0Queiroz (Eds.) Logic, language, information, and computation - 26th international workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2\u20135, 2019, Proceedings, Lecture Notes in Computer Science, vol. 11541, pp. 356\u2013372. Springer.","DOI":"10.1007\/978-3-662-59533-6_22"},{"key":"9348_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(93)90091-7","volume":"121","author":"J Klop","year":"1993","unstructured":"Klop, J., van Oostrom, V., & van Raamsdonk, F. (1993). Combinatory reduction systems: Introduction and survey. Theoretical Computer Science, 121, 279\u2013308.","journal-title":"Theoretical Computer Science"},{"key":"9348_CR12","unstructured":"Kubota, Y. (2010). (in)flexibility of constituency in japanese in multi-modal categorial grammar with structured phonology. Ph.D. thesis, The Ohio State University."},{"key":"9348_CR13","doi-asserted-by":"crossref","unstructured":"Kubota, Y., & Levine, R. (2012). Gapping as like-category coordination. Lecture Notes in Computer Science. In D. B\u00e9chet & A. Dikovsky (Eds.), Logical aspects of computational linguistics (Vol. 7351, pp. 135\u2013150). Nantes: Springer.","DOI":"10.1007\/978-3-642-31262-5_9"},{"key":"9348_CR14","unstructured":"Kubota, Y., & Levine, R. (2013a). Coordination in hybrid type-logical grammar. In Ohio State University working papers in linguistics, vol.\u00a060. Columbus, Ohio."},{"key":"9348_CR15","doi-asserted-by":"crossref","unstructured":"Kubota, Y., & Levine, R. (2013b). Determiner gapping as higher-order discontinuous constituency. In G. Morrill, M. J. Nederhof (Eds.) Formal grammar, lecture notes in computer science, vol. 8036, pp. 225\u2013241. Springer.","DOI":"10.1007\/978-3-642-39998-5_14"},{"key":"9348_CR16","doi-asserted-by":"publisher","unstructured":"Kubota, Y., & Levine, R. (2015). Against ellipsis: Arguments for the direct licensing of \u2018noncanonical\u2019 coordinations. Linguistics and Philosophy, 38, 521\u2013576. https:\/\/doi.org\/10.1007\/s10988-015-9179-7.","DOI":"10.1007\/s10988-015-9179-7"},{"key":"9348_CR17","doi-asserted-by":"crossref","unstructured":"Kubota, Y., & Levine, R. (2020). Type-logical syntax. MIT Press.","DOI":"10.7551\/mitpress\/11866.001.0001"},{"key":"9348_CR18","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\u20133","key":"9348_CR19","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\u20133), 239\u2013311.","journal-title":"Annals of Pure and Applied Logic"},{"key":"9348_CR20","unstructured":"Martin, S. (2013). The dynamics of sense and implicature. Ph.D. thesis, The Ohio State University."},{"key":"9348_CR21","doi-asserted-by":"publisher","unstructured":"Mihali\u010dek, V., & Pollard, C. (2012). Distinguishing phenogrammar from tectogrammar simplifies the analysis of interrogatives. In Formal grammar: FG2010, FG2011, Lecture Notes in Computer Science, vol. 7395, pp. 130\u2013145. Springer. https:\/\/doi.org\/10.1007\/978-3-642-32024-8_9","DOI":"10.1007\/978-3-642-32024-8_9"},{"key":"9348_CR22","unstructured":"Mihali\u010dik, V. (2012). Serbo-croatian word order: A logical approach. Ph.D. thesis, The Ohio State University."},{"key":"9348_CR23","doi-asserted-by":"publisher","DOI":"10.1515\/9783112329580","volume-title":"Categorial investigations: Logical and linguistic aspects of the Lambek calculus","author":"M Moortgat","year":"1988","unstructured":"Moortgat, M. (1988). Categorial investigations: Logical and linguistic aspects of the Lambek calculus. Dordrecht: Foris."},{"key":"9348_CR24","doi-asserted-by":"crossref","unstructured":"Moortgat, M. (1997). Categorial type logics. In J. van Benthem, A. ter Meulen (Eds.) Handbook of logic and language, chap.\u00a02, pp. 93\u2013177. Elsevier\/MIT Press.","DOI":"10.1016\/B978-044481714-3\/50005-9"},{"key":"9348_CR25","doi-asserted-by":"crossref","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, diagrammatic discourse, pp. 283\u2013320. Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199646296.003.0010"},{"key":"9348_CR26","unstructured":"Moot, R. (2002). Proof nets for linguistic analysis. Ph.D. thesis, Utrecht Institute of Linguistics OTS, Utrecht University."},{"key":"9348_CR27","unstructured":"Moot, R. (2014). Hybrid type-logical grammars, first-order linear logic and the descriptive inadequacy of lambda grammars. Tech. rep.: LaBRI (CNRS), Bordeaux University."},{"issue":"3","key":"9348_CR28","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":"9348_CR29","doi-asserted-by":"crossref","unstructured":"Moot, R., & Stevens-Guille, S. J. (2019). Proof-theoretic aspects of hybrid type-logical grammars. In Proceedings of formal grammar 2019, Lecture Notes in Computer Science, vol. 11668, pp. 84\u2013100. Springer.","DOI":"10.1007\/978-3-662-59648-7_6"},{"key":"9348_CR30","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, pp. 61\u201370. Bergen, Norway.","DOI":"10.3115\/977035.977045"},{"key":"9348_CR31","unstructured":"Muskens, R. (2001). Categorial grammar and lexical-functional grammar. In Proceedings of the LFG01 conference, pp. 259\u2013279. University of Hong Kong."},{"key":"9348_CR32","doi-asserted-by":"crossref","unstructured":"Newman, M. H. A. (1942). On theories with a combinatorial definition of \u201cequivalence.\u201d Annals of mathematics, 43(2), 223\u2013243.","DOI":"10.2307\/1968867"},{"issue":"1","key":"9348_CR33","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"},{"issue":"1\u20132","key":"9348_CR34","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0304-3975(98)00315-6","volume":"222","author":"G Perrier","year":"1999","unstructured":"Perrier, G. (1999). A PSPACE-complete fragment of second order linear logic. Theoretical Computer Science, 222(1\u20132), 267\u2013289.","journal-title":"Theoretical Computer Science"},{"key":"9348_CR35","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s11229-013-0373-2","volume":"192","author":"C Pollard","year":"2015","unstructured":"Pollard, C. (2015). Agnostic hyperintensional semantics. Synthese, 192, 535\u2013562. https:\/\/doi.org\/10.1007\/s11229-013-0373-2","journal-title":"Synthese"},{"key":"9348_CR36","doi-asserted-by":"crossref","unstructured":"Savateev, Y. (2009). Product-free Lambek calculus is NP-complete. In Symposium on logical foundations of computer science (LFCS), pp. 380\u2013394.","DOI":"10.1007\/978-3-540-92687-0_26"},{"key":"9348_CR37","unstructured":"Smith, E. A. (2010). Correlational comparison in english. Ph.D. thesis, The Ohio State University."},{"key":"9348_CR38","doi-asserted-by":"crossref","unstructured":"Worth, C. (2014). The phenogrammar of coordination. In Proceedings of the EACL 2014 workshop on type theory and natural language semantics (TTNLS), pp. 28\u201336.","DOI":"10.3115\/v1\/W14-1404"},{"key":"9348_CR39","doi-asserted-by":"crossref","unstructured":"Yoshinaka, R., & Kanazawa, M. (2005). The complexity and generative capacity of lexicalized abstract categorial grammars. In Proceedings of logical aspects of computational linguistics 2005, lecture notes in artificial intelligence, vol. 3492, pp. 330\u2013346. Springer, Bordeaux, France.","DOI":"10.1007\/11422532_22"}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-021-09348-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10849-021-09348-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-021-09348-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,20]],"date-time":"2022-02-20T11:13:23Z","timestamp":1645355603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10849-021-09348-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,24]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["9348"],"URL":"https:\/\/doi.org\/10.1007\/s10849-021-09348-5","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"type":"print","value":"0925-8531"},{"type":"electronic","value":"1572-9583"}],"subject":[],"published":{"date-parts":[[2022,1,24]]},"assertion":[{"value":"8 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}