{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:31:45Z","timestamp":1768869105218,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003151","type":"print"},{"value":"9783540362807","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36280-0_3","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:16:50Z","timestamp":1187248610000},"page":"35-49","source":"Crossref","is-referenced-by-count":8,"title":["Pregroups: Models and Grammars"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Buszkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01066355","volume":"3","author":"H. Andr\u00e9ka","year":"1994","unstructured":"H. Andr\u00e9ka and S. Mikula\u015b, Lambek calculus and its relational semantics: completeness and incompleteness, Journal of Logic, Language and Information 3 (1994), 1\u201337.","journal-title":"Journal of Logic, Language and Information"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"D. Bargelli and J. Lambek, An algebraic approach to French sentence structure, in [9], 62\u201378.","DOI":"10.1007\/3-540-48199-0_4"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"W. Buszkowski, Mathematical Linguistics and Proof Theory, in [17], 683\u2013736.","DOI":"10.1016\/B978-044481714-3\/50016-3"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0304-3975(97)00266-1","volume":"199","author":"W. Buszkowski","year":"1998","unstructured":"W. Buszkowski, Algebraic structures in categorial grammar, Theoretical Computer Science 199 (1998), 5\u201324.","journal-title":"Theoretical Computer Science"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"W. Buszkowski, Lambek grammars based on pregroups, in [9], 95\u2013109.","DOI":"10.1007\/3-540-48199-0_6"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1997-3111","volume":"31","author":"W. Buszkowski","year":"1997","unstructured":"W. Buszkowski and M. Ko\u0142owska-Gawiejnowicz, Representation of residuated semigroups in some algebras of relations. (The method of canonical models.), Fundamenta Informatic\u00e6 31 (1997), 1\u201312.","journal-title":"Fundamenta Informatic\u00e6"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"C. Casadio and J. Lambek, An algebraic analysis of clitic pronouns in Italian, in [9], 110\u2013124.","DOI":"10.1007\/3-540-48199-0_7"},{"key":"3_CR8","volume-title":"Partially Ordered Algebraic Systems","author":"L. Fuchs","year":"1963","unstructured":"L. Fuchs, Partially Ordered Algebraic Systems, Pergamon Press, Oxford, 1963."},{"key":"3_CR9","series-title":"LNAI","volume-title":"Logical Aspects of Computational Linguistics","year":"2001","unstructured":"P. de Groote, G. Morrill and C. Retor\u00e9 (eds.), Logical Aspects of Computational Linguistics, LNAI 2099, Springer, Berlin, 2001."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/FI-1986-9104","volume":"9","author":"C. Hoare","year":"1986","unstructured":"C. Hoare and H. Jifeng, The weakest prespecification, Fundamenta Informatic\u00e6 9 (1986), 51\u201384, 217-252.","journal-title":"Fundamenta Informatic\u00e6"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J. Lambek","year":"1958","unstructured":"J. Lambek, The mathematics of sentence structure, American Mathematical Monthly 65 (1958), 154\u2013170.","journal-title":"American Mathematical Monthly"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"J. Lambek, Type grammars revisited, in [13], 1\u201327.","DOI":"10.1007\/3-540-48975-4_1"},{"key":"3_CR13","series-title":"LNAI","volume-title":"Logical Aspects of Computational Linguistics","year":"1999","unstructured":"A. Lecomte, F. Lamarche and G. Perrier (eds.), Logical Aspects of Computational Linguistics, LNAI 1582, Springer, Berlin, 1999."},{"key":"3_CR14","volume-title":"Logical and Linguistic Aspects of the Lambek Calculus","author":"M. Moortgat","year":"1988","unstructured":"M. Moortgat, Categorial Investigations. Logical and Linguistic Aspects of the Lambek Calculus, Foris, Dordrecht, 1988."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"M. Moortgat, Categorial Type Logics, in [17], 93\u2013177.","DOI":"10.1016\/B978-044481714-3\/50005-9"},{"key":"3_CR16","volume-title":"Relational Methods for Computer Science Applications","year":"2001","unstructured":"E. Or\u0142owska and A. Sza\u0142as (eds.), Relational Methods for Computer Science Applications, Physica Verlag, Heidelberg, 2001."},{"key":"3_CR17","volume-title":"Handbook of Logic and Language","year":"1997","unstructured":"J. van Benthem and A. ter Meulen (eds.), Handbook of Logic and Language, Elsevier, Amsterdam, The MIT Press, Cambridge Mass., 1997."}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36280-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T21:44:29Z","timestamp":1629582269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36280-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003151","9783540362807"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36280-0_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}