{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T12:17:11Z","timestamp":1771244231059,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032143389","type":"print"},{"value":"9783032143396","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-14339-6_11","type":"book-chapter","created":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T11:37:02Z","timestamp":1771241822000},"page":"199-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Correspondence Theory of\u00a0Modal Logic with\u00a0Counting"],"prefix":"10.1007","author":[{"given":"Xiaoxuan","family":"Fu","sequence":"first","affiliation":[]},{"given":"Zhiguang","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,17]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de\u00a0Rijke, M., Venema, Y.: Modal logic, volume\u00a053 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (2001)","DOI":"10.1017\/CBO9781107050884"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Conradie, W., Goranko, V., Vakarelov, D.: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. Logical Methods in Computer Science 2, 1\u201326 (2006)","DOI":"10.2168\/LMCS-2(1:5)2006"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.apal.2011.10.004","volume":"163","author":"W Conradie","year":"2012","unstructured":"Conradie, W., Palmigiano, A.: Algorithmic correspondence and canonicity for distributive modal logic. Ann. Pure Appl. Logic 163(3), 338\u2013376 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Fu, X.,\u00a0Zhao, Z.: Numerical expressive power of logical languages with cardinality comparison. J. Logic Comput. (2024)","DOI":"10.1093\/logcom\/exae028"},{"key":"11_CR5","unstructured":"Ma, M.: Model theory for graded modal languages. PhD thesis, Tsinghua University (2011)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Sahlqvist, H.: Completeness and correspondence in the first and second order semantics for modal logic. In: Studies in Logic and the Foundations of Mathematics, vol. 82, pp. 110\u2013143 (1975)","DOI":"10.1016\/S0049-237X(08)70728-6"},{"key":"11_CR7","unstructured":"van Benthem, J.: Modal Correspondence Theory. PhD thesis, University of Amsterdam (1977)"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1017\/bsl.2023.30","volume":"29","author":"J van Benthem","year":"2023","unstructured":"van Benthem, J., Icard, T.: Interleaving logic and counting. Bull. Symb. Log. 29(4), 503\u2013587 (2023)","journal-title":"Bull. Symb. Log."},{"issue":"1","key":"11_CR9","first-page":"81","volume":"2","author":"W van der Hoek","year":"1992","unstructured":"van der Hoek, W.: On the semantics of graded modalities. J. Appl. Non-Classical Logics 2(1), 81\u2013123 (1992)","journal-title":"J. Appl. Non-Classical Logics"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1142\/S0218488596000044","volume":"4","author":"W van der Hoek","year":"1996","unstructured":"van der Hoek, W.: Qualitative modalities. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 4(1), 45\u201360 (1996)","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01051767","volume":"2","author":"W van der Hoek","year":"1993","unstructured":"van der Hoek, W., de Rijke, M.: Generalized quantifiers and modal logic. J. Logic Lang. Inform. 2(1), 19\u201358 (1993)","journal-title":"J. Logic Lang. Inform."},{"issue":"6","key":"11_CR12","first-page":"66","volume":"15","author":"Z Zhao","year":"2022","unstructured":"Zhao, Z.: Algorithmic correspondence theory for sabotage modal logic. Stud. Logic 15(6), 66\u201392 (2022)","journal-title":"Stud. Logic"},{"key":"11_CR13","unstructured":"Zhao, Z.: Taming \u201cMcKinsey-like\u201d formula: An extended correspondence and completeness theory for hybrid logic H(@). Submitted. ArXiv preprint arXiv:2210.04433 (2022)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-14339-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T11:37:05Z","timestamp":1771241825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-14339-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032143389","9783032143396"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-14339-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"17 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TbiLLC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Tbilisi Symposium on Logic, Language, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Telavi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tbillc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.illc.uva.nl\/Tbilisi\/Tbilisi2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}