{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:38:47Z","timestamp":1743035927366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031506277"},{"type":"electronic","value":"9783031506284"}],"license":[{"start":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T00:00:00Z","timestamp":1703721600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T00:00:00Z","timestamp":1703721600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-50628-4_12","type":"book-chapter","created":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T18:02:14Z","timestamp":1703700134000},"page":"187-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lambek Calculus with\u00a0Optional Divisions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4779-3143","authenticated-orcid":false,"given":"Tikhon","family":"Pshenitsyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,28]]},"reference":[{"unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. Addison-Wesley Series in Computer Science\/World Student Series Edition, Addison-Wesley (1986)","key":"12_CR1"},{"doi-asserted-by":"crossref","unstructured":"De Kuthy, K., Detmar Meurers, W.: Dealing with optional complements in HPSG-Based grammar implementations. In: Proceedings of the HPSG03 Conference, Michigan State University, East Lansing (2003)","key":"12_CR2","DOI":"10.21248\/hpsg.2003.5"},{"key":"12_CR3","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. Inform. 1, 141\u2013171 (1992)","journal-title":"J. Logic Lang. Inform."},{"issue":"3","key":"12_CR4","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. Amer. Math. Monthly 65(3), 154\u2013170 (1958)","journal-title":"Amer. Math. Monthly"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00159344","volume":"5","author":"M Moortgat","year":"1996","unstructured":"Moortgat, M.: Multimodal linguistic inference. J. Logic. Lang. Inf. 5, 349\u2013385 (1996)","journal-title":"J. Logic. Lang. Inf."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31555-8","volume-title":"The Logic of Categorial Grammars","author":"R Moot","year":"2012","unstructured":"Moot, R., Retor\u00e9, C.: The Logic of Categorial Grammars. LNCS, vol. 6850. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31555-8"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10849-010-9129-2","volume":"20","author":"G Morrill","year":"2011","unstructured":"Morrill, G., Valent\u00edn, O., Fadda, M.: The displacement calculus. J. Logic Lang. Inform. 20(1), 1\u201348 (2011)","journal-title":"J. Logic Lang. Inform."},{"issue":"4","key":"12_CR8","first-page":"519","volume":"6","author":"A Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. J. Logic Lang. Inform. 6(4), 519\u2013535 (2001)","journal-title":"J. Logic Lang. Inform."},{"unstructured":"Pentus, M.: Lambek grammars are context free. In: Proceedings of the 8th Annual Symposium on Logic in Computer Science, Montreal, Canada (1993)","key":"12_CR9"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/321406.321412","volume":"14","author":"DJ Rosenkrantz","year":"1967","unstructured":"Rosenkrantz, D.J.: Matrix equations and normal forms for context-free grammars. J. ACM 14(3), 501\u2013507 (1967)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Selected Reflections in Language, Logic, and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50628-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T18:03:29Z","timestamp":1703700209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50628-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,28]]},"ISBN":["9783031506277","9783031506284"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50628-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,28]]},"assertion":[{"value":"28 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESSLLI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Summer School in Logic, Language and Information","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Riga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latvia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esslli2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.df.lu.lv\/en\/research\/conferences\/esslli-2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Two rounds of review: first double bline, then single blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3+3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}