{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:54Z","timestamp":1761611274747},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253884"},{"type":"electronic","value":"9783540319825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31982-5_28","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:29:02Z","timestamp":1294990142000},"page":"440-454","source":"Crossref","is-referenced-by-count":18,"title":["Expressivity of Coalgebraic Modal Logic: The Limits and Beyond"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Schr\u00f6der","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M. Barr","year":"1993","unstructured":"Barr, M.: Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci.\u00a0114, 299\u2013315 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR2","series-title":"ENTCS","volume-title":"A hierarchy of probabilistic system types, Coalgebraic Methods in Computer Science","author":"F. Bartels","year":"2003","unstructured":"Bartels, F., Sokolova, A., de Vink, E.: A hierarchy of probabilistic system types. In: Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a082. Elsevier, Amsterdam (2003)"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Chellas, B.: Modal logic, Cambridge (1980)","DOI":"10.1017\/CBO9780511621192"},{"key":"28_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":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 258\u2013275. Springer, Heidelberg (2004)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s001530100110","volume":"41","author":"G. D\u2019Agostino","year":"2002","unstructured":"D\u2019Agostino, G., Visser, A.: Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic\u00a041, 267\u2013298 (2002)","journal-title":"Arch. Math. Logic"},{"key":"28_CR7","series-title":"ENTCS","first-page":"121","volume-title":"Coalgebraic Methods in Computer Science","author":"H.H. Hansen","year":"2004","unstructured":"Hansen, H.H., Kupke, C.: A coalgebraic perspective on monotone modal logic. In: Ad\u00e1mek, J., Milius, S. (eds.) Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a0106, pp. 121\u2013143. Elsevier, Amsterdam (2004)"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for non-determinism and concurrency. J. ACM\u00a032, 137\u2013161 (1985)","journal-title":"J. ACM"},{"key":"28_CR9","series-title":"ENTCS","volume-title":"Coalgebraic Methods in Computer Science","author":"B. Jacobs","year":"2000","unstructured":"Jacobs, B.: Towards a duality result in the modal logic of coalgebras. In: Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a033. Elsevier, Amsterdam (2000)"},{"key":"28_CR10","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."},{"key":"28_CR11","series-title":"ENTCS","first-page":"201","volume-title":"Coalgebraic Methods in Computer Science","author":"B. Klin","year":"2004","unstructured":"Klin, B.: A coalgebraic approach to process equivalence and a coinduction principle for traces. In: Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a0106, pp. 201\u2013218. Elsevier, Amsterdam (2004)"},{"key":"28_CR12","unstructured":"Kurz, A.: Logics for coalgebras and applications to computer science, Ph.D. thesis, Universit\u00e4t M\u00fcnchen (2000)"},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0304-3975(00)00125-0","volume":"260","author":"A. Kurz","year":"2001","unstructured":"Kurz, A.: Specifying coalgebras with modal logic. Theoret. Comput. Sci. 260, 119\u2013138 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-45931-6_17","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Kurz","year":"2002","unstructured":"Kurz, A.: Logics admitting final semantics. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 238\u2013249. Springer, Heidelberg (2002)"},{"key":"28_CR15","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\u201328 (1991)","journal-title":"Inform. Comput."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0168-0072(98)00042-6","volume":"96","author":"L. Moss","year":"1999","unstructured":"Moss, L.: Coalgebraic logic. Ann. Pure Appl. Logic\u00a096, 277\u2013317 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"key":"28_CR17","unstructured":"Mossakowski, T., Schr\u00f6der, L., Roggenbach, M., Reichel, H.: Algebraic-co-algebraic specification in CoCASL. J. Logic Algebraic Programming (to appear)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Pattinson, D.: Expressivity results in the modal logic of coalgebras, Ph.D. thesis, Universit\u00e4t M\u00fcnchen (2001)","DOI":"10.1007\/3-540-44693-1_45"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-44693-1_45","volume-title":"STACS 2001","author":"D. Pattinson","year":"2001","unstructured":"Pattinson, D.: Semantical principles in the modal logic of coalgebras. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 514\u2013526. Springer, Heidelberg (2001)"},{"key":"28_CR20","doi-asserted-by":"publisher","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 Logic\u00a045, 19\u201333 (2004)","journal-title":"Notre Dame J. Formal Logic"},{"key":"28_CR21","series-title":"ENTCS","volume-title":"Coalgebraic Methods in Computer Science","author":"J. Power","year":"2000","unstructured":"Power, J., Watanabe, H.: An axiomatics for categories of coalgebras. In: Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a011. Elsevier, Amsterdam (2000)"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"R\u00f6\u00dfiger, M.: Coalgebras and modal logic. In: Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a033. Elsevier, Amsterdam (2000)","DOI":"10.1016\/S1571-0661(05)80353-6"},{"key":"28_CR23","first-page":"175","volume":"7","author":"J. Rothe","year":"2001","unstructured":"Rothe, J., Tews, H., Jacobs, B.: The Coalgebraic Class Specification Language CCSL. J. Universal Comput. Sci.\u00a07, 175\u2013193 (2001)","journal-title":"J. Universal Comput. Sci."},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: A theory of systems. Theoret. Comput. Sci.\u00a0249, 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02573590","volume":"25","author":"J. Siekmann","year":"1982","unstructured":"Siekmann, J., Szabo, P.: A noetherian and confluent rewrite system for idempotent semigroups. Semigroup Forum\u00a025, 83\u2013110 (1982)","journal-title":"Semigroup Forum"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31982-5_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:32:57Z","timestamp":1605760377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31982-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253884","9783540319825"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31982-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}