{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:14:40Z","timestamp":1759032880774},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_23","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T20:07:56Z","timestamp":1267992476000},"page":"328-342","source":"Crossref","is-referenced-by-count":7,"title":["Coalgebraic Correspondence Theory"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Schr\u00f6der","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_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":"23_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)"},{"key":"23_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic","author":"B. Chellas","year":"1980","unstructured":"Chellas, B.: Modal Logic. Cambridge University Press, Cambridge (1980)"},{"key":"23_CR4","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":"23_CR5","first-page":"21","volume-title":"Logic in Computer Science, LICS 2005","author":"A. Dawar","year":"2005","unstructured":"Dawar, A., Otto, M.: Modal characterisation theorems over special classes of frames. In: Panangaden, P. (ed.) Logic in Computer Science, LICS 2005, pp. 21\u201330. IEEE Computer Society, Los Alamitos (2005)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1005245900406","volume":"64","author":"M. Rijke de","year":"2000","unstructured":"de Rijke, M.: A note on graded modal logic. Stud. Log.\u00a064, 271\u2013283 (2000)","journal-title":"Stud. Log."},{"key":"23_CR7","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":"23_CR8","first-page":"105","volume-title":"Logic Colloquium 1981","author":"H. Gaifman","year":"1982","unstructured":"Gaifman, H.: On local and non-local properties. In: Logic Colloquium 1981, pp. 105\u2013135. North Holland, Amsterdam (1982)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/11548133_13","volume-title":"Algebra and Coalgebra in Computer Science","author":"H.P. Gumm","year":"2005","unstructured":"Gumm, H.P.: From T-coalgebras to filter structures and transition systems. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 194\u2013212. Springer, Heidelberg (2005)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0004-3702(90)90019-V","volume":"46","author":"J.Y. Halpern","year":"1990","unstructured":"Halpern, J.Y.: An analysis of first-order logics of probability. Artif. Intell.\u00a046, 311\u2013350 (1990)","journal-title":"Artif. Intell."},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73859-6_19","volume-title":"Algebra and Coalgebra in Computer Science","author":"H.H. Hansen","year":"2007","unstructured":"Hansen, H.H., Kupke, C., Pacuit, E.: Bisimulation for neighbourhood structures. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 279\u2013293. Springer, Heidelberg (2007)"},{"key":"23_CR12","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":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1007\/3-540-60246-1_160","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D. Janin","year":"1995","unstructured":"Janin, D., Walukiewicz, I.: Automata for the modal \u03bc-calculus and related results. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 552\u2013562. Springer, Heidelberg (1995)"},{"key":"23_CR14","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":"23_CR15","doi-asserted-by":"crossref","unstructured":"Otto, M.: Bisimulation invariance and finite models. In: Logic Colloquium 2002. Lect. Notes Log., vol.\u00a027, pp. 276\u2013298. ASL (2006)","DOI":"10.1017\/9781316755723.013"},{"key":"23_CR16","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."},{"key":"23_CR17","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"},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1023\/A:1008275906015","volume":"6","author":"E. Rosen","year":"1997","unstructured":"Rosen, E.: Modal logic over finite structures. J. Logic, Language and Information\u00a06(4), 427\u2013439 (1997)","journal-title":"J. Logic, Language and Information"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jlap.2006.11.004","volume":"73","author":"L. Schr\u00f6der","year":"2007","unstructured":"Schr\u00f6der, L.: A finite model construction for coalgebraic modal logic. J. Log. Algebr. Prog.\u00a073, 97\u2013110 (2007)","journal-title":"J. Log. Algebr. Prog."},{"key":"23_CR20","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. Theoret. Comput. Sci.\u00a0390, 230\u2013247 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR21","first-page":"673","volume-title":"Theoretical Aspects of Computer Science, STACS 2009, Leibniz International Proceedings in Informatics","author":"L. Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Pattinson, D.: Strong completeness of coalgebraic modal logics. In: Albers, S., Marion, J.-Y. (eds.) Theoretical Aspects of Computer Science, STACS 2009, Leibniz International Proceedings in Informatics, pp. 673\u2013684. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2009)"},{"key":"23_CR22","unstructured":"van Benthem, J.: Modal Correspondence Theory. PhD thesis, Department of Mathematics, University of Amsterdam (1976)"}],"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-642-12032-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:47:01Z","timestamp":1606168021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}