{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:21:13Z","timestamp":1743096073810,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662538258"},{"type":"electronic","value":"9783662538265"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T00:00:00Z","timestamp":1478736000000},"content-version":"vor","delay-in-days":314,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a new semantics for the (full) Lambek calculus, which is based on an automata-theoretic construction. This automata-theoretic semantics combines languages and relations via closure operators which are based on automaton transitions. We establish the strong completeness of this semantics for the full Lambek calculus via an isomorphism theorem for the syntactic concepts lattice of a language and a construction for the universal automaton recognizing the same language. Automata-theoretic semantics is interesting because it connects two important semantics of the Lambek calculus, namely the relational and the language-theoretic. At the same time, it establishes a strong relation between two canonical constructions over a given language, namely its syntactic concept lattice and its universal automaton.<\/jats:p>","DOI":"10.1007\/978-3-662-53826-5_19","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T11:59:48Z","timestamp":1478692788000},"page":"308-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Automatic Concepts and Automata-Theoretic Semantics for the Full Lambek Calculus"],"prefix":"10.1007","author":[{"given":"Christian","family":"Wurm","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0022-4049(94)00147-2","volume":"105","author":"C Brown","year":"1995","unstructured":"Brown, C., Gurr, D.: Relations and non-commutative linear logic. J. Pure Appl. Algebra 105(2), 117\u2013136 (1995)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1\u20135","key":"19_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/malq.19860320104","volume":"32","author":"W Buszkowski","year":"1986","unstructured":"Buszkowski, W.: Completeness results for Lambek syntactic calculus. Math. Logic Q. 32(1\u20135), 13\u201328 (1986)","journal-title":"Math. Logic Q."},{"issue":"1\u20132","key":"19_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0304-3975(97)00266-1","volume":"1998","author":"W Buszkowski","year":"1998","unstructured":"Buszkowski, W.: Algebraic structures in categorial grammar. Theor. Comput. Sci. 1998(1\u20132), 5\u201324 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-20169-1_12","volume-title":"Formal Grammar","author":"A Clark","year":"2011","unstructured":"Clark, A.: A learnable representation for syntax using residuated lattices. In: Groote, P., Egg, M., Kallmeyer, L. (eds.) FG 2009. LNCS (LNAI), vol. 5591, pp. 183\u2013198. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20169-1_12"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-15488-1_5","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"A Clark","year":"2010","unstructured":"Clark, A.: Learning context free grammars with the syntactic concept lattice. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS (LNAI), vol. 6339, pp. 38\u201351. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-15488-1_5"},{"issue":"5","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1093\/logcom\/ext037","volume":"25","author":"A Clark","year":"2015","unstructured":"Clark, A.: The syntactic concept lattice: another algebraic theory of the context-free languages? J. Log. Comput. 25(5), 1203\u20131229 (2015)","journal-title":"J. Log. Comput."},{"key":"19_CR7","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"1991","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (1991)","edition":"2"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s11225-005-6776-4","volume":"80","author":"M Farulewski","year":"2005","unstructured":"Farulewski, M.: On finite models of the Lambek calculus. Stud. Logica. 80(1), 63\u201374 (2005)","journal-title":"Stud. Logica."},{"key":"19_CR9","volume-title":"Residuated Lattices: An Algebraic Glimpse at Substructural Logics","author":"N Galatos","year":"2007","unstructured":"Galatos, N., Jipsen, P., Kowalski, T., Ono, H.: Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Elsevier, Amsterdam (2007)"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00171695","volume":"1","author":"M Kanazawa","year":"1992","unstructured":"Kanazawa, M.: The Lambek calculus enriched with additional connectives. J. Logic Lang. Inf. 1, 141\u2013171 (1992)","journal-title":"J. Logic Lang. Inf."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1080\/00029890.1958.11989160","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. Am. Math. Mon. 65, 154\u2013169 (1958)","journal-title":"Am. Math. Mon."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Lambek, J.: On the calculus of syntactic types. In: Jakobson, R. (ed.) Structure of Language and its Mathematical Aspects, pp. 166\u2013178. Providence (1961)","DOI":"10.1090\/psapm\/012\/9972"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-44121-3_8","volume-title":"Formal Grammar","author":"H Lei\u00df","year":"2014","unstructured":"Lei\u00df, H.: Learning context free grammars with the finite context property: a correction of A.\u00a0Clark\u2019s algorithm. In: Morrill, G., Muskens, R., Osswald, R., Richter, F. (eds.) Formal Grammar 2014. LNCS, vol. 8612, pp. 121\u2013137. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44121-3_8"},{"key":"19_CR14","unstructured":"Lombardy, S., Sakarovitch, J.: The universal automaton. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic, Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games, vol. 2, pp. 457\u2013504. Amsterdam University Press (2008)"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"790","DOI":"10.2307\/2586501","volume":"64","author":"M Okada","year":"1999","unstructured":"Okada, M., Terui, K.: The finite model property for various fragments of intuitionistic linear logic. J. Symb. Logic 64(2), 790\u2013802 (1999)","journal-title":"J. Symb. Logic"},{"key":"19_CR16","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 for the Lambek calculus. Ann. Pure Appl. Logic 75, 179\u2013213 (1995)","journal-title":"Ann. Pure Appl. Logic"},{"key":"19_CR17","unstructured":"Sestier, A.: Contributions \u00e0 une th\u00e9orie ensembliste des classifications linguistiques. (Contributions to a set-theoretical theory of classifications). In: Actes du Ier Congr\u00e8s de l\u2019AFCAL, Grenoble, pp. 293\u2013305 (1960)"},{"key":"19_CR18","unstructured":"van Benthem, J.: Language in Action: Categories, Lambdas and Dynamic Logic. Studies in Logic and the Foundations of Mathematics, vol. 130. North-Holland, Amsterdam (1991)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-39998-5_8","volume-title":"Formal Grammar","author":"C Wurm","year":"2013","unstructured":"Wurm, C.: Completeness of full Lambek calculus for syntactic concept lattices. In: Morrill, G., Nederhof, M.-J. (eds.) FG 2012-2013. LNCS, vol. 8036, pp. 126\u2013141. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39998-5_8"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-662-53042-9_10","volume-title":"Formal Grammar","author":"C Wurm","year":"2016","unstructured":"Wurm, C.: On some extensions of syntactic concept lattices: completeness and finiteness results. In: Foret, A., Morrill, G., Muskens, R., Osswald, R., Pogodalla, S. (eds.) FG 2015-2016. LNCS, vol. 9804, pp. 164\u2013179. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-53042-9_10"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996\u20132016)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53826-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:23:50Z","timestamp":1709821430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-53826-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662538258","9783662538265"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53826-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"10 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LACL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logical Aspects of Computational Linguistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lacl2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lacl.gforge.inria.fr\/lacl-2016\/index-presentation.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}