{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:59:28Z","timestamp":1725728368286},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_13","type":"book-chapter","created":{"date-parts":[[2013,6,2]],"date-time":"2013-06-02T21:03:04Z","timestamp":1370206984000},"page":"150-161","source":"Crossref","is-referenced-by-count":0,"title":["Lower and Upper Bounds for the Length of Joins in the Lambek Calculus"],"prefix":"10.1007","author":[{"given":"Alexey","family":"Sorokin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.2307\/2275485","volume":"56","author":"V.M. Abrusci","year":"1991","unstructured":"Abrusci, V.M.: Phase semantics and sequent calculus for pure non-commutative classical linear logic. Journal of Symbolic Logic\u00a056(4), 1403\u20131451 (1991)","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11225-007-9084-3","volume":"87","author":"D. B\u00e9chet","year":"2007","unstructured":"B\u00e9chet, D.: Parsing pregroup grammars and Lambek calculus using partial composition. Studia Logica\u00a087(2), 199\u2013224 (2007)","journal-title":"Studia Logica"},{"key":"13_CR3","unstructured":"Foret, A.: Conjoinability and unification in Lambek categorial grammars. In: Proceedings of the 5th ROMA Workshop on New Perspectives in Logic and Formal Linguistics, Bulzoni, Roma (2001)"},{"key":"13_CR4","unstructured":"Foret, A.: On the computation of joins for non-associative Lambek categorial grammars. In: Proceedings of the 17th International Workshop on Unification, UNIF, vol.\u00a03, pp. 25\u201338 (2003)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"1","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a01, 1\u2013101 (1987)","journal-title":"Theoretical Computer Science"},{"key":"#cr-split#-13_CR6.1","unstructured":"Grishin, V.: On a generalization of the Ajdukewicz-Lambek system. In: Studies on Nonclassical Logics and Formal Systems, Nauka, Moscow (1983) (in Russian)"},{"key":"#cr-split#-13_CR6.2","unstructured":"English translation in: Proceedings of the 5th ROMA Workshop on New Perspectives in Logic and Formal, Linguistics. Bulzoni Editore, Roma (2001)"},{"key":"13_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48975-4_1","volume-title":"Logical Aspects of Computational Linguistics","author":"J. Lambek","year":"1999","unstructured":"Lambek, J.: Type grammar revisited. In: Lecomte, A., Perrier, G., Lamarche, F. (eds.) LACL 1997. LNCS (LNAI), vol.\u00a01582, pp. 1\u201327. Springer, Heidelberg (1999)"},{"key":"13_CR8","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":"13_CR9","unstructured":"Moortgat, M., Pentus, M.: Type similarity for the Lambek-Grishin calculus. In: Proceedings of the 12th Conference on Formal Grammar, Dublin (2007)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"The Logic of Categorial Grammars","year":"2012","unstructured":"Moot, R., Retor\u00e9, C. (eds.): The Logic of Categorial Grammars. LNCS, vol.\u00a06850. Springer, Heidelberg (2012)"},{"key":"13_CR11","unstructured":"Pentus, M.: Equivalent types in Lambek calculus and linear logic. Preprint. Department of mathematical logic, Steklov Mathematical Institute, Moscow 2 (1992)"},{"key":"13_CR12","unstructured":"Pentus, M.: The conjoinability relation in Lambek calculus and linear logic. ILLC Prepublication Series ML-93-03. Institute for Logic, Language and Computation, University of Amsterdam (1993)"},{"key":"13_CR13","unstructured":"Pentus, M.: Lambek grammars are context-free. In: Proceedings of the Logic in Computer Science, LICS 1993, pp. 429\u2013433 (1993)"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0168-0072(94)00063-9","volume":"75","author":"M. Pentus","year":"1995","unstructured":"Pentus, M.: Models of the Lambek calculus. Annals of Pure and Applied Logic\u00a075(1), 179\u2013213 (1995)","journal-title":"Annals of Pure and Applied Logic"},{"key":"13_CR15","first-page":"171","volume-title":"Proceedings of Logic Colloquium 1996","author":"M. Pentus","year":"1998","unstructured":"Pentus, M.: Free monoid completeness of the Lambek calculus allowing empty premises. In: Larrazabal, J.M., Lascar, D., Mints, G. (eds.) Proceedings of Logic Colloquium 1996, pp. 171\u2013209. Springer, Berlin (1998)"},{"key":"13_CR16","unstructured":"Roorda, D.: Resource logic: proof theoretical investigations. PhD thesis, FWI, Universiteit van Amsterdam (1991)"},{"issue":"4","key":"13_CR17","doi-asserted-by":"publisher","first-page":"168","DOI":"10.3103\/S0027132207040092","volume":"62","author":"A. Safiullin","year":"2007","unstructured":"Safiullin, A.: Derivability of admissible rules with simple premises in the Lambek calculus. Moscow University Mathematics Bulletin\u00a062(4), 168\u2013171 (2007)","journal-title":"Moscow University Mathematics Bulletin"},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.3103\/S0027132211030028","volume":"66","author":"A. Sorokin","year":"2011","unstructured":"Sorokin, A.: On the length of joins in Lambek calculus. Moscow University Mathematics Bulletin\u00a066(3), 101\u2013104 (2011)","journal-title":"Moscow University Mathematics Bulletin"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.2307\/2274953","volume":"55","author":"D. Yetter","year":"1990","unstructured":"Yetter, D.: Quantales and (noncommutative) linear logic. Journal of Symbolic Logic\u00a055(1), 41\u201364 (1990)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:19:57Z","timestamp":1557749997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}