{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:26:11Z","timestamp":1762323971128},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662529201"},{"type":"electronic","value":"9783662529218"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-52921-8_8","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T11:22:30Z","timestamp":1470396150000},"page":"109-124","source":"Crossref","is-referenced-by-count":4,"title":["Expressivity of Many-Valued Modal Logics, Coalgebraically"],"prefix":"10.1007","author":[{"given":"Marta","family":"B\u00edlkov\u00e1","sequence":"first","affiliation":[]},{"given":"Mat\u011bj","family":"Dost\u00e1l","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/978-3-642-40206-7_7","volume-title":"Algebra and Coalgebra in Computer Science","author":"M B\u00edlkov\u00e1","year":"2013","unstructured":"B\u00edlkov\u00e1, M., Dost\u00e1l, M.: Many-valued relation lifting and Moss\u2019 coalgebraic logic. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol. 8089, pp. 66\u201379. Springer, Heidelberg (2013)"},{"issue":"5","key":"8_CR2","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1093\/logcom\/exp062","volume":"21","author":"F Bou","year":"2011","unstructured":"Bou, F., Esteva, F., Godo, L., Rodr\u00edguez, R.: On the minimum many-valued modal logic over a finite residuated lattice. J. Log. Comput. 21(5), 739\u2013790 (2011)","journal-title":"J. Log. Comput."},{"key":"8_CR3","unstructured":"Dost\u00e1l, M.: Many valued coalgebraic logic. Master thesis, Czech Technical University (2013)"},{"key":"8_CR4","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":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/978-3-662-44124-4_7","volume-title":"Coalgebraic Methods in Computer Science","author":"HP Gumm","year":"2014","unstructured":"Gumm, H.P., Zarrad, M.: Coalgebraic simulations and congruences. In: Bonsangue, M.M. (ed.) CMCS 2014. LNCS, vol. 8446, pp. 118\u2013134. Springer, Heidelberg (2014)"},{"key":"8_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-5300-3","volume-title":"Metamathematics of Fuzzy Logic","author":"P H\u00e1jek","year":"1998","unstructured":"H\u00e1jek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1093\/logcom\/exn093","volume":"20","author":"B Jacobs","year":"2010","unstructured":"Jacobs, B., Sokolova, A.: Exemplaric expressivity of modal logics. J. Log. Comput. 20, 1041\u20131068 (2010)","journal-title":"J. Log. Comput."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Kupke, C., Kurz, A., Pattinson, D.: Algebraic semantics for coalgebraic logics. In: Coalgebraic Methods in Computer Science, ENTCS, vol. 106, pp. 219\u2013241. Elsevier (2004)","DOI":"10.1016\/j.entcs.2004.02.037"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.tcs.2004.07.023","volume":"327","author":"C Kupke","year":"2004","unstructured":"Kupke, C., Kurz, A., Venema, Y.: Stone coalgebras. Theoret. Comput. Sci. 327, 109\u2013134 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"8_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-8(3:2)2012","volume":"8","author":"C Kupke","year":"2012","unstructured":"Kupke, C., Kurz, A., Venema, Y.: Completeness for the coalgebraic cover modality. Log. Methods Comput. Sci. 8(3), 1\u201376 (2012)","journal-title":"Log. Methods Comput. Sci."},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.tcs.2012.03.027","volume":"430","author":"A Kurz","year":"2012","unstructured":"Kurz, A., Leal, R.: Modalities in the Stone age: a comparison of coalgebraic logics. Theoret. Comput. Sci. 430, 88\u2013116 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2268660","volume":"16","author":"R McNaughton","year":"1951","unstructured":"McNaughton, R.: A theorem about infinite-valued sentential logic. J. Symbolic Log. 16, 1\u201313 (1951)","journal-title":"J. Symbolic Log."},{"key":"8_CR13","first-page":"407","volume":"10","author":"G Metcalfe","year":"2014","unstructured":"Metcalfe, G., Mart\u00ed, M.: A Hennessy-Milner property for many-valued modal logics. Adv. Modal Log. 10, 407\u2013420 (2014)","journal-title":"Adv. Modal Log."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Pattinson, D.: Expressivity results in the modal logic of coalgebras (2001)","DOI":"10.1007\/3-540-44693-1_45"},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1305\/ndjfl\/1094155277","volume":"45","author":"D Pattinson","year":"2004","unstructured":"Pattinson, D.: Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Log. 45, 19\u201333 (2004)","journal-title":"Notre Dame J. Formal Log."},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.tcs.2007.09.023","volume":"390","author":"L Schr\u00f6der","year":"2008","unstructured":"Schr\u00f6der, L.: Expressivity of coalgebraic modal logic: the limits and beyond. Theoret. Comput. Sci. 390, 230\u2013247 (2008)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-52921-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T03:12:41Z","timestamp":1568257961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-52921-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662529201","9783662529218"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-52921-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}