{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:17:39Z","timestamp":1742926659919,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031626869"},{"type":"electronic","value":"9783031626876"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62687-6_13","type":"book-chapter","created":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T15:01:50Z","timestamp":1717772510000},"page":"193-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lambek Calculus with\u00a0Banged Atoms for\u00a0Parasitic Gaps"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5863-7835","authenticated-orcid":false,"given":"Mehrnoosh","family":"Sadrzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4661-6540","authenticated-orcid":false,"given":"Lutz","family":"Stra\u00dfburger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,8]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0168-0072(99)00014-7","volume":"101","author":"VM Abrusci","year":"2000","unstructured":"Abrusci, V.M., Ruet, P.: Non-commutative logic I: the multiplicative fragment. Ann. Pure Appl. Logic 101, 29\u201364 (2000)","journal-title":"Ann. Pure Appl. Logic"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Barry, G., Hepple, M., Leslie, N., Morrill, G.: Proof figures and structural operators for categorial grammar. In: Kunze, J., Reimann, D. (eds.) EACL 1991, 5th Conference of the European Chapter of the Association for Computational Linguistics, 9\u201311 April 1991, Congress Hall, Alexanderplatz, Berlin, Germany, pp. 198\u2013203. The Association for Computer Linguistics (1991)","DOI":"10.3115\/977180.977215"},{"volume-title":"Parasitic Gaps","year":"2001","key":"13_CR3","unstructured":"Culicover, P., Postal, P. (eds.): Parasitic Gaps. MIT Press, Cambridge (2001)"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Arch. Math. Log. 28(3), 181\u2013203 (1989)","journal-title":"Arch. Math. Log."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00868088","volume":"6","author":"E Engdahl","year":"1983","unstructured":"Engdahl, E.: Parasitic gaps. Linguist. Philos. 6(1), 5\u201334 (1983)","journal-title":"Linguist. Philos."},{"key":"13_CR6","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. Theoret. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR7","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.: On the unity of logic. Ann. Pure Appl. Logic 59, 201\u2013217 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1182613.1182614","volume":"8","author":"A Guglielmi","year":"2007","unstructured":"Guglielmi, A.: A system of interaction and structure. ACM Trans. Comput. Logic 8(1), 1\u201364 (2007)","journal-title":"ACM Trans. Comput. Logic"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-44802-0_5","volume-title":"Computer Science Logic","author":"A Guglielmi","year":"2001","unstructured":"Guglielmi, A., Stra\u00dfburger, L.: Non-commutativity and MELL in the calculus of structures. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 54\u201368. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44802-0_5"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Heijltjes, W., Houston, R.: Proof equivalence in MLL is PSPACE-complete. Log. Methods Comput. Sci. 12(1) (2016)","DOI":"10.2168\/LMCS-12(1:2)2016"},{"key":"13_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-3905-0","volume-title":"Anaphora and Type Logical Grammar","author":"G J\u00e4ger","year":"2006","unstructured":"J\u00e4ger, G.: Anaphora and Type Logical Grammar, vol. 24. Springer, Dordrecht (2006). https:\/\/doi.org\/10.1007\/1-4020-3905-0"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00171695","volume":"1","author":"M Kanazawa","year":"1992","unstructured":"Kanazawa, M.: The lambek calculus enriched with additional connectives. J. Logic Lang. Inform. 1(2), 141\u2013171 (1992)","journal-title":"J. Logic Lang. Inform."},{"issue":"8","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1017\/S0960129518000117","volume":"29","author":"MI Kanovich","year":"2019","unstructured":"Kanovich, M.I., Kuznetsov, S.L., Nigam, V., Scedrov, A.: Subexponentials in non-commutative linear logic. Math. Struct. Comput. Sci. 29(8), 1217\u20131249 (2019)","journal-title":"Math. Struct. Comput. Sci."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-030-51074-9_29","volume-title":"Automated Reasoning","author":"M Kanovich","year":"2020","unstructured":"Kanovich, M., Kuznetsov, S., Nigam, V., Scedrov, A.: Soft subexponentials and multiplexing. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12166, pp. 500\u2013517. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51074-9_29"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-53042-9_14","volume-title":"Formal Grammar","author":"M Kanovich","year":"2016","unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: Undecidability of the lambek calculus with a relevant modality. In: Foret, A., Morrill, G., Muskens, R., Osswald, R., Pogodalla, S. (eds.) FG 2015-2016. LNCS, vol. 9804, pp. 240\u2013256. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53042-9_14"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-662-55751-8_26","volume-title":"Fundamentals of Computation Theory","author":"M Kanovich","year":"2017","unstructured":"Kanovich, M., Kuznetsov, S., Scedrov, A.: Undecidability of the lambek calculus with subexponential and bracket modalities. In: Klasing, R., Zeitoun, M. (eds.) FCT 2017. LNCS, vol. 10472, pp. 326\u2013340. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-55751-8_26"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1093\/logcom\/exaa010","volume":"30","author":"MI Kanovich","year":"2020","unstructured":"Kanovich, M.I., Kuznetsov, S.L., Scedrov, A.: Reconciling lambek\u2019s restriction, cut-elimination and substitution in the presence of exponential modalities. J. Log. Comput. 30(1), 239\u2013256 (2020)","journal-title":"J. Log. Comput."},{"key":"13_CR18","unstructured":"Kogkalidis, K., Moortgat, M., Moot, R.: \u00c6thel: automatically extracted typelogical derivations for Dutch. In: Calzolari, N., et al. (eds.) Proceedings of The 12th Language Resources and Evaluation Conference, LREC 2020, Marseille, France, 11\u201316 May 2020, pp. 5257\u20135266. European Language Resources Association (2020)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Kogkalidis, K., Moortgat, M., Moot, R.: SPINDLE: spinning raw text into lambda terms with graph attention. In: Croce, D., Soldaini, L. (eds.) Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics. EACL 2023 - System Demonstrations, Dubrovnik, Croatia, 2\u20134 May 2023, pp. 128\u2013135. Association for Computational Linguistics (2023)","DOI":"10.18653\/v1\/2023.eacl-demo.15"},{"key":"13_CR20","unstructured":"Lamarche, F., Retor\u00e9, C.: Proof nets for the Lambek-calculus \u2014 an overview. In: Michele Abrusci, V., Casadio, C. (eds.) Proceedings of the Third Roma Workshop \u201cProofs and Linguistic Categories\u201d, pp. 241\u2013262. CLUEB, Bologna (1996)"},{"key":"13_CR21","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. Am. Math. Monthly 65, 154\u2013170 (1958)","journal-title":"Am. Math. Monthly"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2733375","volume":"16","author":"R Lazi\u0107","year":"2015","unstructured":"Lazi\u0107, R., Schmitz, S.: Nonelementary complexities for branching VASS, MELL, and extensions. ACM Trans. Comput. Logic 16(3), 1\u201330 (2015)","journal-title":"ACM Trans. Comput. Logic"},{"key":"13_CR23","first-page":"1","volume":"22","author":"L Mcpheat","year":"2021","unstructured":"Mcpheat, L., Wijnholds, G., Sadrzadeh, M., Correia, A., Toumi, A.: Anaphora and ellipsis in lambek calculus with a relevant modality: Syntax and semantics. J. Cogn. Sci. 22, 1\u201334 (2021)","journal-title":"J. Cogn. Sci."},{"issue":"3\u20134","key":"13_CR24","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00159344","volume":"5","author":"M Moortgat","year":"1996","unstructured":"Moortgat, M.: Multimodal linguistic inference. J. Logic Lang. Inform. 5(3\u20134), 349\u2013385 (1996)","journal-title":"J. Logic Lang. Inform."},{"key":"13_CR25","unstructured":"Moortgat, M., Oehrle, R.: Structural abstractions. In: Proofs and Linguistic Categories: Application of Logic to the Analysis and Implementation of Natural Language, Proceedings of the 1996 Roma Workshop (1996)"},{"issue":"5","key":"13_CR26","first-page":"823","volume":"7","author":"M Moortgat","year":"2020","unstructured":"Moortgat, M., Sadrzadeh, M., Wijnholds, G.: A frobenius algebraic analysis for parasitic gaps. FLAP 7(5), 823\u2013852 (2020)","journal-title":"FLAP"},{"key":"13_CR27","first-page":"823","volume":"7","author":"M Moortgat","year":"2020","unstructured":"Moortgat, M., Sadrzadeh, M., Wijnholds, G.: A frobenius algebraic analysis for parasitic gaps. J. Appl. Log. 7, 823\u2013852 (2020)","journal-title":"J. Appl. Log."},{"key":"13_CR28","unstructured":"Moot, R.: Semi-automated extraction of a wide-coverage type-logical grammar for French. In: Langlais, P., Gagnon, M. (eds.) Actes de la 17e conf\u00e9rence sur le Traitement Automatique des Langues Naturelles. Articles courts, TALN 2010, Montr\u00e9al, Canada, July 2010, pp. 189\u2013194. ATALA (2010)"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Moot, R.: The grail theorem prover: type theory for syntax and semantics. CoRR, abs\/1602.00812 (2016)","DOI":"10.1007\/978-3-319-50422-3_10"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1023\/A:1020525032763","volume":"71","author":"R Moot","year":"2002","unstructured":"Moot, R., Puite, Q.: Proof nets for the multimodal lambek calculus. Stud. Logica. 71, 415\u2013442 (2002)","journal-title":"Stud. Logica."},{"key":"13_CR31","unstructured":"Morrill, G., Leslie, N., Hepple, M., Barry, G.: Categorial deductions and structural operations. Studies in Categorial Grammar. Edinburgh Working Papers in Cognitive Science (1990)"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Morrill, G., Valent\u00edn, O.: Computational coverage of TLG: Nonlinearity. In: Proceedings of Third Workshop on Natural Language and Computer Science, vol.\u00a032, pp. 51\u201363. EasyChair Publications (2015)","DOI":"10.29007\/96j5"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-662-53826-5_14","volume-title":"Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996\u20132016)","author":"G Morrill","year":"2016","unstructured":"Morrill, G., Valent\u00edn, O.: On the logic of expansion in natural language. In: Amblard, M., de Groote, P., Pogodalla, S., Retor\u00e9, C. (eds.) LACL 2016. LNCS, vol. 10054, pp. 228\u2013246. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53826-5_14"},{"issue":"1","key":"13_CR34","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.: The displacement calculus. J. Logic Lang. Inform. 20(1), 1\u201348 (2011)","journal-title":"J. Logic Lang. Inform."},{"key":"13_CR35","doi-asserted-by":"crossref","unstructured":"Nigam, V., Miller, D.: Algorithmic specifications in linear logic with subexponentials. In: ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), pp. 129\u2013140 (2009)","DOI":"10.1145\/1599410.1599427"},{"key":"13_CR36","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-94-010-0037-6_9","volume-title":"Resource-Sensitivity, Binding and Anaphora","author":"RT Oehrle","year":"2003","unstructured":"Oehrle, R.T.: Resource-sensitivity\u2013a brief guide. In: Kruijff, G.-J.M., Oehrle, R.T. (eds.) Resource-Sensitivity, Binding and Anaphora, pp. 231\u2013255. Springer, Dordrecht (2003). https:\/\/doi.org\/10.1007\/978-94-010-0037-6_9"},{"issue":"1\u20133","key":"13_CR37","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."},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-62688-3_43","volume-title":"Typed Lambda Calculi and Applications","author":"C Retor\u00e9","year":"1997","unstructured":"Retor\u00e9, C.: Pomset logic: a non-commutative extension of classical linear logic. In: de Groote, P., Roger Hindley, J. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 300\u2013318. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62688-3_43"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Stra\u00dfburger, L.: System NEL is undecidable. In: De\u00a0Queiroz, R., Pimentel, E., Figueiredo, L. (eds.) 10th Workshop on Logic, Language, Information and Computation (WoLLIC). Electronic Notes in Theoretical Computer Science, vol.\u00a084, pp. 166\u2013177 (2003)","DOI":"10.1016\/S1571-0661(04)80853-3"},{"issue":"1","key":"13_CR40","doi-asserted-by":"publisher","first-page":"41","DOI":"10.2307\/2274953","volume":"55","author":"DN Yetter","year":"1990","unstructured":"Yetter, D.N.: Quantales and (noncommutative) linear logic. J. Symb. Log. 55(1), 41\u201364 (1990)","journal-title":"J. Symb. Log."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62687-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T10:37:17Z","timestamp":1732185437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62687-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031626869","9783031626876"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62687-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"8 June 2024","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":"Bern","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2024.inf.unibe.ch\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}