{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:06:08Z","timestamp":1725505568753},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784975"},{"type":"electronic","value":"9783540784999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_6","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"66-80","source":"Crossref","is-referenced-by-count":9,"title":["Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics"],"prefix":"10.1007","author":[{"given":"Dirk","family":"Pattinson","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-3-540-31982-5_29","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Bonsangue","year":"2005","unstructured":"Bonsangue, M., Kurz, A.: Duality logics for transition systems. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 455\u2013469. Springer, Heidelberg (2005)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/11690634_12","volume-title":"Foundations of Software Science and Computation Structures","author":"M. Bonsangue","year":"2006","unstructured":"Bonsangue, M., Kurz, A.: Presenting functors by operations and equations. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 172\u2013186. Springer, Heidelberg (2006)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Chellas, B.: Modal Logic, Cambridge (1980)","DOI":"10.1017\/CBO9780511621192"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2004.07.021","volume":"327","author":"C. C\u00eerstea","year":"2004","unstructured":"C\u00eerstea, C.: A compositional approach to defining logics for coalgebras. Theoret. Comput. Sci.\u00a0327, 45\u201369 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-28644-8_17","volume-title":"CONCUR 2004 - Concurrency Theory","author":"C. C\u00eerstea","year":"2004","unstructured":"C\u00eerstea, C., Pattinson, D.: Modular construction of modal logics. Theoret. Comput. Sci. (to appear). In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 258\u2013275. Springer, Heidelberg (2004)"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF02770513","volume":"48","author":"K. D\u01d2sen","year":"1989","unstructured":"D\u01d2sen, K.: Duality between modal algebras and neighbourhood frames. Studia Logica\u00a048(2), 219\u2013234 (1989)","journal-title":"Studia Logica"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/174652.174658","volume":"41","author":"R. Fagin","year":"1994","unstructured":"Fagin, R., Halpern, J.: Reasoning about knowledge and probability. J. ACM\u00a041, 340\u2013367 (1994)","journal-title":"J. ACM"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K. Fine","year":"1972","unstructured":"Fine, K.: In so many possible worlds. Notre Dame J. Formal Logic\u00a013, 516\u2013520 (1972)","journal-title":"Notre Dame J. Formal Logic"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1006\/game.1999.0788","volume":"35","author":"A. Heifetz","year":"2001","unstructured":"Heifetz, A., Mongin, P.: Probabilistic logic for type spaces. Games and Economic Behavior\u00a035, 31\u201353 (2001)","journal-title":"Games and Economic Behavior"},{"key":"6_CR10","series-title":"Cambridge Studies in Advanced Mathematics","volume-title":"Stone spaces","author":"P. Johnstone","year":"1993","unstructured":"Johnstone, P.: Stone spaces. Cambridge Studies in Advanced Mathematics, vol.\u00a03. Cambridge University Press, Cambridge (1993)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"891","DOI":"10.2307\/2372123","volume":"73","author":"B. J\u00f3nnson","year":"1951","unstructured":"J\u00f3nnson, B., Tarski, A.: Boolean algebras with operators I. Amer. J. Math.\u00a073, 891\u2013939 (1951)","journal-title":"Amer. J. Math."},{"issue":"1\u20132","key":"6_CR12","doi-asserted-by":"publisher","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. Theor. Comput. Sci.\u00a0327(1\u20132), 109\u2013134 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen, K., Skou, A.: Bisimulation through probabilistic testing. Inform. Comput.\u00a094(1), 1\u201328 (1991)","journal-title":"Inform. Comput."},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"46","DOI":"10.2307\/2270619","volume":"31","author":"E. Lemmon","year":"1966","unstructured":"Lemmon, E.: Algebraic semantics for modal logics I. Journal of Symbolic Logic\u00a031(1), 46\u201365 (1966)","journal-title":"Journal of Symbolic Logic"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(03)00201-9","volume":"309","author":"D. Pattinson","year":"2003","unstructured":"Pattinson, D.: Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci.\u00a0309, 177\u2013193 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M. Pauly","year":"2002","unstructured":"Pauly, M.: A modal logic for coalitional power in games. J. Logic Comput.\u00a012(1), 149\u2013166 (2002)","journal-title":"J. Logic Comput."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11690634_11","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Schr\u00f6der","year":"2006","unstructured":"Schr\u00f6der, L.: A finite model construction for coalgebraic modal logic. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 157\u2013171. Springer, Heidelberg (2006)"},{"key":"6_CR18","first-page":"231","volume-title":"Logic in Computer Science, LICS 2006","author":"L. Schr\u00f6der","year":"2006","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE reasoning for rank-1 modal logics. In: Logic in Computer Science, LICS 2006, pp. 231\u2013240. IEEE, Los Alamitos (2006)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73420-8_41","volume-title":"Automata, Languages and Programming","author":"L. Schr\u00f6der","year":"2007","unstructured":"Schr\u00f6der, L., Pattinson, D.: Compositional algorithms for heterogeneous modal logics. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, Springer, Heidelberg (2007)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-540-70918-3_49","volume-title":"STACS 2007","author":"L. Schr\u00f6der","year":"2007","unstructured":"Schr\u00f6der, L., Pattinson, D.: Rank-1 modal logics are coalgebraic. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 573\u2013585. Springer, Heidelberg (2007)"},{"key":"6_CR21","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-76771-5","volume-title":"Universal Algebra for Computer Scientists","author":"W. Wechler","year":"1992","unstructured":"Wechler, W.: Universal Algebra for Computer Scientists. EATCS Monographs on Theoretical Computer Science, vol.\u00a025. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:37Z","timestamp":1619521897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_6","relation":{},"subject":[]}}