{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:32:45Z","timestamp":1725895965017},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201684"},{"type":"electronic","value":"9783642201691"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20169-1_8","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T09:21:04Z","timestamp":1301304064000},"page":"118-132","source":"Crossref","is-referenced-by-count":2,"title":["The Generative Capacity of the Lambek\u2013Grishin Calculus: A New Lower Bound"],"prefix":"10.1007","author":[{"given":"Matthijs","family":"Melissen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.2307\/410452","volume":"29","author":"Y. Bar-Hillel","year":"1953","unstructured":"Bar-Hillel, Y.: A quasi-arithmetical notation for syntactic description. Language\u00a029, 47\u201358 (1953)","journal-title":"Language"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/1-4020-2295-6_13","volume-title":"New Developments in Parsing Technology","author":"P. Boullier","year":"2004","unstructured":"Boullier, P.: Range concatenation grammars. In: New Developments in Parsing Technology, pp. 269\u2013289. Kluwer Academic Publishers, Norwell (2004)"},{"key":"8_CR3","first-page":"507","volume":"34","author":"W. Buszkowski","year":"1986","unstructured":"Buszkowski, W.: Generative capacity of nonassociative Lambek calculus. Bulletin of Polish Academy of Sciences: Mathematics\u00a034, 507\u2013516 (1986)","journal-title":"Bulletin of Polish Academy of Sciences: Mathematics"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10849-004-2113-y","volume":"13","author":"J.M. Casta\u00f1o","year":"2004","unstructured":"Casta\u00f1o, J.M.: Global index grammars and descriptive power. J. of Logic, Lang. and Inf.\u00a013(4), 403\u2013419 (2004)","journal-title":"J. of Logic, Lang. and Inf."},{"key":"8_CR5","first-page":"315","volume-title":"Studies in Non-classical Logics and Formal Systems","author":"V.N. Grishin","year":"1983","unstructured":"Grishin, V.N.: On a generalization of the Ajdukiewicz-Lambek system. In: Mikhailov, A.I. (ed.) Studies in Non-classical Logics and Formal Systems, pp. 315\u2013343. Nauka, Moscow (1983)"},{"key":"8_CR6","first-page":"81","volume-title":"Van Periferie Naar Kern","author":"R. Huybregts","year":"1984","unstructured":"Huybregts, R.: The weak inadequacy of context-free phrase structure grammars. In: Trommelen, M., de Haan, G.J., Zonneveld, W. (eds.) Van Periferie Naar Kern, pp. 81\u201399. Foris Publications, Dordrecht (1984)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A. Joshi","year":"1975","unstructured":"Joshi, A., Levy, L.S., Takahashi, M.: Tree adjunct grammars. Journal of Computer and System Sciences\u00a010(1), 136\u2013163 (1975)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR8","series-title":"Beyond Words","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-59126-6_2","volume-title":"Handbook of Formal Languages","author":"A. Joshi","year":"1997","unstructured":"Joshi, A., Schabes, Y.: Tree-adjoining grammars. In: Handbook of Formal Languages. Beyond Words, vol.\u00a03, pp. 69\u2013123. Springer, Inc., New York (1997)"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/malq.19880340106","volume":"34","author":"M. Kandulski","year":"1988","unstructured":"Kandulski, M.: The equivalence of nonassociative Lambek categorial grammars and context-free grammars. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a034(1), 41\u201352 (1988)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"8_CR10","series-title":"Proceedings of Symposia in Applied Mathematics","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1090\/psapm\/012\/9972","volume-title":"Structure of Language and its Mathematical Aspects","author":"J. Lambek","year":"1961","unstructured":"Lambek, J.: On the calculus of syntactic types. In: Jacobsen, R. (ed.) Structure of Language and its Mathematical Aspects. Proceedings of Symposia in Applied Mathematics, vol.\u00a0XII, pp. 166\u2013178. American Mathematical Society, Providence (1961)"},{"key":"8_CR11","unstructured":"Melissen, M.: Lambek\u2013Grishin calculus extended to connectives of arbitrary arity. In: Proceedings of the 20th Belgian-Netherlands Conference on Artificial Intelligence (2008)"},{"key":"8_CR12","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":"8_CR13","unstructured":"Moot, R.: Lambek grammars, tree adjoining grammars and hyperedge replacement grammars. In: Proceedings of the TAG+ Conference, HAL - CCSD (2008)"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R. Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM\u00a013(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"8_CR15","first-page":"429","volume-title":"Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science","author":"M. Pentus","year":"1993","unstructured":"Pentus, M.: Lambek grammars are context free. In: Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, pp. 429\u2013433. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Course Technology (December 1996)","DOI":"10.1145\/230514.571645"},{"key":"8_CR17","series-title":"Studies in logic and the foundations of mathematics","volume-title":"Language in action: categories, lambdas and dynamic logic","author":"J. Benthem Van","year":"1991","unstructured":"Van Benthem, J.: Language in action: categories, lambdas and dynamic logic. Studies in logic and the foundations of mathematics, vol.\u00a0130. North-Holland, Amsterdam (1991)"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20169-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T14:11:02Z","timestamp":1558534262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20169-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201684","9783642201691"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20169-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}