{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:03:05Z","timestamp":1746244985978,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":58,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642547881"},{"type":"electronic","value":"9783642547898"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54789-8_17","type":"book-chapter","created":{"date-parts":[[2014,4,3]],"date-time":"2014-04-03T09:58:44Z","timestamp":1396519124000},"page":"297-330","source":"Crossref","is-referenced-by-count":7,"title":["Extended Lambek Calculi and First-Order Linear Logic"],"prefix":"10.1007","author":[{"given":"Richard","family":"Moot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A. Aho","year":"1968","unstructured":"Aho, A.: Indexed grammars: An extension of context-free grammars. Journal of the ACM\u00a015(4), 647\u2013671 (1968)","journal-title":"Journal of the ACM"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Andreoli, J.-M.: Logic programming with focussing proofs in linear logic. Journal of Logic and Computation\u00a02(3) (1992)","DOI":"10.1093\/logcom\/2.3.297"},{"key":"17_CR3","first-page":"116","volume-title":"Language and Information. Selected Essays on their Theory and Application","author":"Y. Bar-Hillel","year":"1964","unstructured":"Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. In: Bar-Hillel, Y. (ed.) Language and Information. Selected Essays on their Theory and Application, pp. 116\u2013150. Addison-Wesley, New York (1964)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bellin, G., van de Wiele, J.: Empires and kingdoms in MLL. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 249\u2013270. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511629150.013"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-73445-1_5","volume-title":"Logic, Language, Information and Computation","author":"R. Bernardi","year":"2007","unstructured":"Bernardi, R., Moortgat, M.: Continuation semantics for symmetric categorial grammar. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol.\u00a04576, pp. 53\u201371. Springer, Heidelberg (2007)"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1093\/jigpal\/11.4.419","volume":"11","author":"R. Bernardi","year":"2003","unstructured":"Bernardi, R., Moot, R.: Generalized quantifiers in declarative and interrogative sentences. Logic Journal of the IGPL\u00a011(4), 419\u2013434 (2003)","journal-title":"Logic Journal of the IGPL"},{"key":"17_CR7","unstructured":"Boullier, P.: Proposal for a natural language processing syntactic backbone. Technical Report 3342, INRIA, Rocquencourt (1998)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Boullier, P., Sagot, B.: Efficient and robust LFG parsing: SxLfg. In: International Workshop on Parsing Technologies (2005)","DOI":"10.3115\/1654494.1654495"},{"key":"17_CR9","unstructured":"Danos, V.: La Logique Lin\u00e9aire Appliqu\u00e9e \u00e0 l\u2019\u00e9tude de Divers Processus de Normalisation (Principalement du \u03bb-Calcul). PhD thesis, University of Paris VII (June 1990)"},{"key":"17_CR10","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. Archive for Mathematical Logic\u00a028, 181\u2013203 (1989)","journal-title":"Archive for Mathematical Logic"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/malq.19920380113","volume":"38","author":"K. Do\u0161en","year":"1992","unstructured":"Do\u0161en, K.: A brief survey of frames for the Lambek calculus. Zeitschrift f\u00fcr Mathematische Logic und Grundlagen der Mathematik\u00a038, 179\u2013187 (1992)","journal-title":"Zeitschrift f\u00fcr Mathematische Logic und Grundlagen der Mathematik"},{"key":"17_CR12","unstructured":"Fadda, M.: Geometry of Grammar: Exercises in Lambek Style. PhD thesis, Universitat Polit\u00e8cnica de Catalunya (2010)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-94-009-1337-0_3","volume-title":"Natural Language Parsing and Linguistic Theories","author":"G. Gazdar","year":"1988","unstructured":"Gazdar, G.: Applicability of indexed grammars to natural languages. In: Reyle, U., Rohrer, C. (eds.) Natural Language Parsing and Linguistic Theories, pp. 69\u201394. D. Reidel, Dordrecht (1988)"},{"key":"17_CR14","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. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","unstructured":"Girard, J.-Y.: Quantifiers in linear logic II. In: Corsi, G., Sambin, G. (eds.) Nuovi Problemi Della Logica e Della Filosofia Della Scienza, Bologna, Italy, vol.\u00a0II. CLUEB (1991). Proceedings of the conference with the same name, Viareggio, Italy (January 1990)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Linear logic: Its syntax and semantics. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 1\u201342. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511629150.002"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S096012950100336X","volume":"11","author":"J.-Y. Girard","year":"2001","unstructured":"Girard, J.-Y.: Locus solum: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science\u00a011, 301\u2013506 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"17_CR18","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press (1988)"},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S.A. Greibach","year":"1965","unstructured":"Greibach, S.A.: A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM\u00a012(1), 42\u201352 (1965)","journal-title":"Journal of the ACM"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Guerrini, S.: Correctness of multiplicative proof nets is linear. In: Fourteenth Annual IEEE Symposium on Logic in Computer Science, pp. 454\u2013263. IEEE Computer Science Society (1999)","DOI":"10.1109\/LICS.1999.782640"},{"key":"17_CR21","unstructured":"Huybregts, R.: The weak inadequacy of context-free phrase structure grammars. In: de Haan, G., Trommelen, M., Zonneveld, W. (eds.) Van Periferie naar Kern. Foris, Dordrecht (1984)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Joshi, A.: Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions. In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Processing: Theoretical, Computational, and Psychological Perspectives. Cambridge University Press (1985)","DOI":"10.1017\/CBO9780511597855.007"},{"issue":"4","key":"17_CR23","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1111\/j.1467-8640.1994.tb00008.x","volume":"10","author":"Y. Kaji","year":"1994","unstructured":"Kaji, Y., Nakanishi, R., Seki, H., Kasami, T.: The computational complexity of the universal recognition problem for parallel multiple context-free grammars. Computational Intelligence\u00a010(4), 440\u2013452 (1994)","journal-title":"Computational Intelligence"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-02737-6_25","volume-title":"Developments in Language Theory","author":"M. Kanazawa","year":"2009","unstructured":"Kanazawa, M.: The pumping lemma for well-nested multiple context-free languages. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 312\u2013325. Springer, Heidelberg (2009)"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Keller, B., Weir, D.: A tractable extension of linear indexed grammars. In: Proceedings of the Seventh Meeting of the European Chapter of the Association for Computational Linguistics, pp. 75\u201382 (1995)","DOI":"10.3115\/976973.976985"},{"key":"17_CR26","first-page":"75","volume-title":"Specifying Syntactic Structures","author":"N. Kurtonina","year":"1997","unstructured":"Kurtonina, N., Moortgat, M.: Structural control. In: Blackburn, P., de Rijke, M. (eds.) Specifying Syntactic Structures, pp. 75\u2013113. CSLI, Stanford (1997)"},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. American Mathematical Monthly\u00a065, 154\u2013170 (1958)","journal-title":"American Mathematical Monthly"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Lincoln, P.: Deciding provability of linear logic formulas. In: Girard, Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic, pp. 109\u2013122. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511629150.006"},{"issue":"1","key":"17_CR29","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0304-3975(94)00107-3","volume":"135","author":"P. Lincoln","year":"1994","unstructured":"Lincoln, P., Scedrov, A.: First order linear logic without modalities is NEXPTIME-hard. Theoretical Computer Science\u00a0135(1), 139\u2013154 (1994)","journal-title":"Theoretical Computer Science"},{"key":"17_CR30","unstructured":"Matsuzaki, T., Miyao, Y., Tsujii, J.: Efficient HPSG parsing with supertagging and CFG-filtering. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, pp. 1671\u20131676 (2007)"},{"issue":"3-4","key":"17_CR31","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00159344","volume":"5","author":"M. Moortgat","year":"1996","unstructured":"Moortgat, M.: Multimodal linguistic inference. Journal of Logic, Language and Information\u00a05(3-4), 349\u2013385 (1996)","journal-title":"Journal of Logic, Language and Information"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-73445-1_19","volume-title":"Logic, Language, Information and Computation","author":"M. Moortgat","year":"2007","unstructured":"Moortgat, M.: Symmetries in natural language syntax and semantics: The Lambek-Grishin calculus. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol.\u00a04576, pp. 264\u2013284. Springer, Heidelberg (2007)"},{"key":"17_CR33","unstructured":"Moortgat, M.: Typelogical grammar. Stanford Encyclopedia of Philosophy Website (2010), http:\/\/plato.stanford.edu\/entries\/typelogical-grammar\/"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Moortgat, M.: Categorial type logics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, ch.\u00a02, pp. 95\u2013179. Elsevier\/MIT Press (2011)","DOI":"10.1016\/B978-0-444-53726-3.00002-5"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Moortgat, M., Moot, R.: Proof nets for the lambek-grishin calculus. In: Grefenstette, E., Heunen, C., Sadrzadeh, M. (eds.) Compositional Methods in Physics and Linguistics, pp. 283\u2013320. Oxford University Press (2013)","DOI":"10.1093\/acprof:oso\/9780199646296.003.0010"},{"key":"17_CR36","unstructured":"Moot, R.: Proof nets and labeling for categorial grammar logics. Master\u2019s thesis, Utrecht University, Utrecht (1996)"},{"key":"17_CR37","unstructured":"Moot, R.: Proof Nets for Linguistic Analysis. PhD thesis, Utrecht Institute of Linguistics OTS, Utrecht University (2002)"},{"key":"17_CR38","unstructured":"Moot, R.: Filtering axiom links for proof nets. In: Kallmeyer, L., Monachesi, P., Penn, G., Satta, G. (eds.) Proceedings of Formal Grammar 2007 (2007) (to appear with CSLI)"},{"key":"17_CR39","unstructured":"Moot, R.: Lambek grammars, tree adjoining grammars and hyperedge replacement grammars. In: Gardent, C., Sarkar, A. (eds.) Proceedings of TAG+9, The Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms, pp. 65\u201372 (2008)"},{"issue":"2","key":"17_CR40","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1008399708659","volume":"10","author":"R. Moot","year":"2001","unstructured":"Moot, R., Piazza, M.: Linguistic applications of first order multiplicative linear logic. Journal of Logic, Language and Information\u00a010(2), 211\u2013232 (2001)","journal-title":"Journal of Logic, Language and Information"},{"issue":"3","key":"17_CR41","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. Studia Logica\u00a071(3), 415\u2013442 (2002)","journal-title":"Studia Logica"},{"key":"17_CR42","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-31555-8","volume-title":"The Logic of Categorial Grammars","author":"R. Moot","year":"2012","unstructured":"Moot, R., Retor\u00e9, C.: The Logic of Categorial Grammars. LNCS, vol.\u00a06850. Springer, Heidelberg (2012)"},{"key":"17_CR43","doi-asserted-by":"crossref","unstructured":"Morrill, G.: Categorial Grammar: Logical Syntax, Semantics, and Processing. Oxford University Press (2011)","DOI":"10.1093\/oxfordhb\/9780199544004.013.0004"},{"issue":"2","key":"17_CR44","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1093\/logcom\/exm089","volume":"18","author":"G. Morrill","year":"2008","unstructured":"Morrill, G., Fadda, M.: Proof nets for basic discontinuous Lambek calculus. Journal of Logic and Computation\u00a018(2), 239\u2013256 (2008)","journal-title":"Journal of Logic and Computation"},{"key":"17_CR45","unstructured":"Morrill, G., Valent\u00edn, O.: On calculus of displacement. In: Proceedings of TAG+Related Formalisms. University of Yale (2010)"},{"issue":"1","key":"17_CR46","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. Journal of Logic, Language and Information\u00a020(1), 1\u201348 (2011)","journal-title":"Journal of Logic, Language and Information"},{"key":"17_CR47","doi-asserted-by":"crossref","unstructured":"Murawski, A.S., Ong, C.-H.L.: Dominator trees and fast verification of proof nets. In: Logic in Computer Science, pp. 181\u2013191 (2000)","DOI":"10.1109\/LICS.2000.855768"},{"key":"17_CR48","doi-asserted-by":"crossref","unstructured":"Nederhof, M.-J., Satta, G.: Theory of parsing. In: Clark, A., Fox, C., Lappin, S. (eds.) The Handbook of Computational Linguistics and Natural Language Processing, pp. 105\u2013130. Wiley-Blackwell (2010)","DOI":"10.1002\/9781444324044.ch4"},{"key":"17_CR49","doi-asserted-by":"publisher","first-page":"648","DOI":"10.2307\/2275553","volume":"62","author":"M. Pentus","year":"1997","unstructured":"Pentus, M.: Product-free Lambek calculus and context-free grammars. Journal of Symbolic Logic\u00a062, 648\u2013660 (1997)","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"17_CR50","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. Theoretical Computer Science\u00a0357(1), 186\u2013201 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1-4","key":"17_CR51","first-page":"441","volume":"36","author":"M. Pentus","year":"2010","unstructured":"Pentus, M.: A polynomial-time algorithm for Lambek grammars of bounded order. Linguistic Analysis\u00a036(1-4), 441\u2013471 (2010)","journal-title":"Linguistic Analysis"},{"key":"17_CR52","volume-title":"Prolog and Natural Language Analysis","author":"F. Pereira","year":"1987","unstructured":"Pereira, F., Shieber, S.: Prolog and Natural Language Analysis. CSLI, Stanford (1987)"},{"key":"17_CR53","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.: On multiple context-free grammars. Theoretical Computer Science\u00a088, 191\u2013229 (1991)","journal-title":"Theoretical Computer Science"},{"key":"17_CR54","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF00630917","volume":"8","author":"S. Shieber","year":"1985","unstructured":"Shieber, S.: Evidence against the context-freeness of natural language. Linguistics & Philosophy\u00a08, 333\u2013343 (1985)","journal-title":"Linguistics & Philosophy"},{"key":"17_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-35722-0_23","volume-title":"Logical Foundations of Computer Science","author":"A. Sorokin","year":"2013","unstructured":"Sorokin, A.: Normal forms for multiple context-free languages and displacement Lambek grammars. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol.\u00a07734, pp. 319\u2013334. Springer, Heidelberg (2013)"},{"key":"17_CR56","unstructured":"Stabler, E.: Tupled pregroup grammars. Technical report, University of California, Los Angeles (2003)"},{"key":"17_CR57","unstructured":"Valent\u00edn, O.: Theory of Discontinuous Lambek Calculus. PhD thesis, Universitat Aut\u00f2noma de Catalunya (2012)"},{"key":"17_CR58","unstructured":"Wijnholds, G.: Investigations into categorial grammar: Symmetric pregroup grammar and displacement calculus, Bachelor thesis, Utrecht University (2011)"}],"container-title":["Lecture Notes in Computer Science","Categories and Types in Logic, Language, and Physics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54789-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T07:21:12Z","timestamp":1746170472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54789-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642547881","9783642547898"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54789-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}