{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:01:49Z","timestamp":1649066509142},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,6,27]],"date-time":"2010-06-27T00:00:00Z","timestamp":1277596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s11225-010-9264-4","type":"journal-article","created":{"date-parts":[[2010,6,26]],"date-time":"2010-06-26T08:14:25Z","timestamp":1277540065000},"page":"417-441","source":"Crossref","is-referenced-by-count":1,"title":["Extending Free Pregroups with Lower Bounds"],"prefix":"10.1007","volume":"95","author":[{"given":"Tamar","family":"Aizikowitz","sequence":"first","affiliation":[]},{"given":"Nissim","family":"Francez","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Genkin","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaminski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,6,27]]},"reference":[{"key":"9264_CR1","doi-asserted-by":"crossref","unstructured":"Buszkowski, W., \u2018Lambek grammars based on pregroups\u2019, in P. De Groote, G. Morrill, and C. Retor\u00e8, (eds.), Logical Aspects of Computational Linguistics, vol. 2099 of Lecture Notes in Computer Science, Springer Verlag, Berlin Heidelberg, 2001, pp. 95\u2013109.","DOI":"10.1007\/3-540-48199-0_6"},{"key":"9264_CR2","doi-asserted-by":"crossref","unstructured":"Buszkowski, W., \u2018Pregroups: models and grammars\u2019, in H. de Swart, (ed.), Relational Methods in Computer Science, vol. 2561 of Lecture Notes in Computer Science, Springer Verlag, Berlin Heidelberg, 2002, pp. 35\u201349.","DOI":"10.1007\/3-540-36280-0_3"},{"key":"9264_CR3","unstructured":"Emms, M., \u2018An undecidability result for polymorphic Lambek calculus\u2019, https:\/\/www.cs.tcd.ie\/Martin.Emms\/Papers\/papers.html . Presented at the 10th Amsterdam Colloquium, 1995."},{"key":"9264_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s11225-007-9088-z","volume":"87","author":"N. Francez","year":"2007","unstructured":"Francez N., Kaminski M.: \u2018Commutation-extended pregroup grammars and mildly context-sensitive languages\u2019. Studia Logica 87, 295\u2013321 (2007)","journal-title":"Studia Logica"},{"key":"9264_CR5","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/234533.234543","volume":"43","author":"A. Ko\u015bcielski","year":"1995","unstructured":"Ko\u015bcielski A., Pacholski L.: \u2018Complexity of Makanin\u2019s algorithm\u2019. Journal of the ACM 43, 670\u2013684 (1995)","journal-title":"Journal of the ACM"},{"key":"9264_CR6","doi-asserted-by":"crossref","unstructured":"Lambek, J., \u2018Type grammars revisited\u2019, in A. Lecomte, F. Lamarche, and G. Perrier, (eds.), Logical Aspects of Computational Linguistics, vol. 1582 of Lecture Notes in Computer Science, Springer Verlag, Berlin Heidelberg, 1999, pp. 1\u201327.","DOI":"10.1007\/3-540-48975-4_1"},{"key":"9264_CR7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1070\/IM1983v021n03ABEH001803","volume":"21","author":"G.S. Makanin","year":"1983","unstructured":"Makanin G.S.: \u2018Equations in a free group\u2019. Mathematics of the USSR-Izvestiya 21, 483\u2013546 (1983)","journal-title":"Mathematics of the USSR-Izvestiya"},{"key":"9264_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1070\/IM1985v025n01ABEH001269","volume":"25","author":"G.S. Makanin","year":"1985","unstructured":"Makanin G.S.: \u2018Decidability of the universal and positive theories of a free group\u2019. Mathematics of the USSR-Izvestiya 25, 75\u201388 (1985)","journal-title":"Mathematics of the USSR-Izvestiya"},{"key":"9264_CR9","doi-asserted-by":"crossref","unstructured":"Moortgat, M., \u2018Categorial type logics\u2019, in J. van Benthem, and A. ter Meulen, (eds.), Handbook of Logic and Language, North Holland, 1997, pp. 93\u2013178.","DOI":"10.1016\/B978-044481714-3\/50005-9"},{"key":"9264_CR10","unstructured":"Sadrzadeh, M., \u2018Pregroup analysis of Persian sentences\u2019, in C. Casadio, and J. Lambek, (eds.), Computational algebraic approaches to natural language, Polimetrica, Milano, Italy, 2008, pp. 121\u2013144."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-010-9264-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11225-010-9264-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-010-9264-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:24:47Z","timestamp":1559370287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11225-010-9264-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,27]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["9264"],"URL":"https:\/\/doi.org\/10.1007\/s11225-010-9264-4","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,27]]}}}