{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T10:10:10Z","timestamp":1746353410786,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_22","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"281-295","source":"Crossref","is-referenced-by-count":4,"title":["Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics"],"prefix":"10.1007","author":[{"given":"Helle Hvid","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Clemens","family":"Kupke","sequence":"additional","affiliation":[]},{"given":"Raul Andres","family":"Leal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.3233\/FUN-2001-45302","volume":"45","author":"P. Balbiani","year":"2001","unstructured":"Balbiani, P., Vakarelov, D.: Iteration-free PDL with intersection: a complete axiomatisation. Fundamenta Informaticae\u00a045, 173\u2013194 (2001)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/A:1027358927272","volume":"75","author":"D. Berwanger","year":"2003","unstructured":"Berwanger, D.: Game Logic is strong enough for parity games. Studia Logica\u00a075(2), 205\u2013219 (2003)","journal-title":"Studia Logica"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Chellas, B.F.: Modal Logic - An Introduction. Cambridge University Press (1980)","DOI":"10.1017\/CBO9780511621192"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Cirstea, C., Kurz, A., Pattinson, D., Schr\u00f6der, L., Venema, Y.: Modal logics are coalgebraic. In: Abramsky, S. (ed.) Visions of Computer Science 2008 (2008)","DOI":"10.14236\/ewic\/VOCS2008.12"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M. Fischer","year":"1979","unstructured":"Fischer, M., Ladner, R.: Propositional dynamic logic of regular programs. J. of Computer and System Sciences\u00a018, 194\u2013211 (1979)","journal-title":"J. of Computer and System Sciences"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Goncharov, S., Schr\u00f6der, L.: A relatively complete generic Hoare logic for order-enriched effects. In: Proceedings of LICS 2013, pp. 273\u2013282. IEEE (2013)","DOI":"10.1109\/LICS.2013.33"},{"key":"22_CR7","unstructured":"Gumm, H.P.: Universal Coalgebras and their Logics (2009)"},{"key":"22_CR8","unstructured":"Hansen, H.H.: Monotonic modal logic (Master\u2019s thesis). Research Report PP-2003-24, Inst. for Logic, Language and Computation. University of Amsterdam (2003)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Hansen, H.H., Kupke, C.: A coalgebraic perspective on monotone modal logic. In: Proceedings of CMCS 2004. ENTCS, vol.\u00a0106, pp. 121\u2013143. Elsevier (2004)","DOI":"10.1016\/j.entcs.2004.02.028"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Hansen, H., Kupke, C., Leal, R.: Strong completeness for iteration-free coalgebraic dynamic logics. Tech. rep., ICIS, Radboud University Nijmegen (to appear, 2014), https:\/\/pms.cs.ru.nl\/iris-diglib\/src\/icis_tech_reports.php","DOI":"10.1007\/978-3-662-44602-7_22"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Hansen, H., Kupke, C., Pacuit, E.: Neighbourhood structures: bisimilarity and basic model theory. Logical Meth. in Comp. Sci.\u00a05(2:2) (2009)","DOI":"10.2168\/LMCS-5(2:2)2009"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. The MIT Press (2000)","DOI":"10.7551\/mitpress\/2516.001.0001"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Hasuo, I.: Generic weakest precondition semantics from monads enriched with order. In: Proceedings of CMCS 2014. LNCS, vol.\u00a08446. Springer (2014)","DOI":"10.1007\/978-3-662-44124-4_2"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: New directions in categorical logic, for classical, probabilistic and quantum logic. In: Logical Meth. in Comp. Sci. (to appear, 2014)","DOI":"10.2168\/LMCS-11(3:24)2015"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Jaocbs, B.: Dijkstra monads in monadic computation. In: Bonsangue, M. (ed.) Proceedings of CMCS 2014. LNCS, vol.\u00a08446, Springer (2014)","DOI":"10.1007\/978-3-662-44124-4_8"},{"key":"22_CR16","unstructured":"Johnstone, P.: Stone Spaces. Cambridge University Press (1982)"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-4049(93)90092-8","volume":"89","author":"G.M. Kelly","year":"1993","unstructured":"Kelly, G.M., Power, A.J.: Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. J. Pure and Appl. Alg.\u00a089, 163\u2013179 (1993)","journal-title":"J. Pure and Appl. Alg."},{"issue":"38","key":"22_CR18","doi-asserted-by":"publisher","first-page":"5070","DOI":"10.1016\/j.tcs.2011.04.023","volume":"412","author":"C. Kupke","year":"2011","unstructured":"Kupke, C., Pattinson, D.: Coalgebraic semantics of modal logics: an overview. Theor. Comp. Sci.\u00a0412(38), 5070\u20135094 (2011)","journal-title":"Theor. Comp. Sci."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Kurz, A., Rosick\u00fd, J.: Strongly complete logics for coalgebras. Logical Meth. Logical Meth. In: Comp. Sci.\u00a08(3:14) (2012)","DOI":"10.2168\/LMCS-8(3:14)2012"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Linton, F.: Some aspects of equational categories. In: Eilenberg, S., Harrison, D., MacLane, S., R\u00f6hrl, H. (eds.) Proceedings of the Conference on Categorical Algebra, pp. 84\u201394. Springer (1966)","DOI":"10.1007\/978-3-642-99902-4_3"},{"key":"22_CR21","unstructured":"MacLane, S.: Categories for the Working Mathematician, 2nd edn. Springer (1998)"},{"key":"22_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9860-1","volume-title":"Algebraic Theories","author":"E.G. Manes","year":"1976","unstructured":"Manes, E.G.: Algebraic Theories. Springer, Berlin (1976)"},{"issue":"2","key":"22_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1090\/S0002-9939-1979-0524290-9","volume":"74","author":"G. Markowsky","year":"1979","unstructured":"Markowsky, G.: Free completely distributive lattices. Proc. Amer. Math. Soc.\u00a074(2), 227\u2013228 (1979)","journal-title":"Proc. Amer. Math. Soc."},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Moggi, E.: Notions of computation and monads. Information and Computation\u00a093(1) (1991)","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Parikh, R.: The logic of games and its applications. In: Topics in the Theory of Computation. Annals of Discrete Mathematics, vol.\u00a014. Elsevier (1985)","DOI":"10.1016\/S0304-0208(08)73078-0"},{"issue":"2","key":"22_CR26","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1027354826364","volume":"75","author":"M. Pauly","year":"2003","unstructured":"Pauly, M., Parikh, R.: Game Logic: An overview. Studia Logica\u00a075(2), 165\u2013182 (2003)","journal-title":"Studia Logica"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D., Power, A.J.: Semantics for algebraic operations. In: Proceedings of MFPS XVII. ENTCS, vol.\u00a045 (2001)","DOI":"10.1016\/S1571-0661(04)80970-8"},{"key":"22_CR28","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. Theor. Comp. Sci.\u00a0249, 3\u201380 (2000)","journal-title":"Theor. Comp. Sci."},{"key":"22_CR29","doi-asserted-by":"publisher","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. Theor. Comp. Sci.\u00a0390, 230\u2013247 (2008)","journal-title":"Theor. Comp. Sci."},{"issue":"2:13","key":"22_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462179.1462185","volume":"10","author":"L. Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE bounds for rank-1 modal logics. ACM Transactions on Computational Logics\u00a010(2:13), 1\u201333 (2009)","journal-title":"ACM Transactions on Computational Logics"},{"key":"22_CR31","unstructured":"Schr\u00f6der, L., Pattinson, D.: Strong completeness of coalgebraic modal logics. In: Proceedings of STACS 2009, pp. 673\u2013684 (2009)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:40:55Z","timestamp":1746351655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}