{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:43Z","timestamp":1761611203643},"reference-count":9,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":4334,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1995,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a new axiomatization of the non\u2010associative Lambek calculus. We prove that it takes polynomial time to reduce any non\u2010associative Lambek categorial grammar to an equivalent context\u2010free grammar. Since it is possible to recognize a sentence generated by a context\u2010free grammar in polynomial time, this proves that a sentence generated by any non\u2010associative Lambek categorial grammar can be recognized in polynomial time.<\/jats:p>","DOI":"10.1002\/malq.19950410405","type":"journal-article","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T20:51:40Z","timestamp":1180817500000},"page":"476-484","source":"Crossref","is-referenced-by-count":20,"title":["Non\u2010associative Lambek Categorial Grammar in Polynomial Time"],"prefix":"10.1002","volume":"41","author":[{"given":"Erik","family":"Aarts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kees","family":"Trautwein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"35","volume-title":"Proceedings of the Ninth Amsterdam Colloquium","author":"Aarts E.","year":"1993"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01057934"},{"key":"e_1_2_1_4_2","first-page":"507","article-title":"Generative capacity of the nonassociative Lambek calculus","volume":"34","author":"Buszkowski W.","year":"1986","journal-title":"Bull. Pol. Acad. Sci. Math."},{"key":"e_1_2_1_5_2","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"1990"},{"key":"e_1_2_1_6_2","first-page":"303","volume-title":"Proceedings of the Eighth Amsterdam Colloquium","author":"Janssen T. M. V.","year":"1991"},{"key":"e_1_2_1_7_2","first-page":"141","volume-title":"Categorial Grammar, Linguistic and Literary Studies in Eastern Europe (LLSEE)","author":"Kandulski M.","year":"1988"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.2307\/2310058"},{"key":"e_1_2_1_9_2","volume-title":"Languages and Parsing. EATCS Monographs on Theoretical Computer Science","author":"Sippu S.","year":"1988"},{"key":"e_1_2_1_10_2","unstructured":"Trautwein K. Een parseeralgoritme voor de niet associatieve Lambek calculus [A parsing algorithm for the non\u2010associative lambek calculus]. Master's thesis University of Amsterdam August1991."}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19950410405","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19950410405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T16:27:35Z","timestamp":1698251255000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19950410405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["10.1002\/malq.19950410405"],"URL":"https:\/\/doi.org\/10.1002\/malq.19950410405","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}