{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:55Z","timestamp":1725511795476},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_49","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T19:41:23Z","timestamp":1179949283000},"page":"573-585","source":"Crossref","is-referenced-by-count":3,"title":["Rank-1 Modal Logics Are Coalgebraic"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Schr\u00f6der","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0304-3975(03)00378-5","volume":"311","author":"J. Ad\u00e1mek","year":"2004","unstructured":"Ad\u00e1mek, J., Porst, H.-E.: On tree coalgebras and coalgebra presentations. Theoret. Comput. Sci.\u00a0311, 257\u2013283 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR2","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":"49_CR3","doi-asserted-by":"crossref","unstructured":"Chellas, B.: Modal Logic. Cambridge (1980)","DOI":"10.1017\/CBO9780511621192"},{"key":"49_CR4","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":"49_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-540-25927-5_7","volume-title":"Deontic Logic in Computer Science","author":"L. Goble","year":"2004","unstructured":"Goble, L.: A proposal for dealing with deontic dilemmas. In: Lomuscio, A., Nute, D. (eds.) DEON 2004. LNCS (LNAI), vol.\u00a03065, pp. 74\u2013113. Springer, Heidelberg (2004)"},{"key":"49_CR6","first-page":"135","volume":"45","author":"H.-P. Gumm","year":"2001","unstructured":"Gumm, H.-P.: Functors for coalgebras. Algebra Universalis\u00a045, 135\u2013147 (2001)","journal-title":"Algebra Universalis"},{"key":"49_CR7","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":"49_CR8","volume-title":"The Blackwell Guide to Philosophical Logic","author":"R. Hilpinen","year":"2001","unstructured":"Hilpinen, R.: Deontic logic. In: Goble, L. (ed.) The Blackwell Guide to Philosophical Logic, Blackwell, Malden (2001)"},{"key":"49_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":"49_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/11548133_17","volume-title":"Algebra and Coalgebra in Computer Science","author":"C. Kupke","year":"2005","unstructured":"Kupke, C., Kurz, A., Pattinson, D.: Ultrafilter extensions for coalgebras. In: Fiadeiro, J.L., et al. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 263\u2013277. Springer, Heidelberg (2005)"},{"key":"49_CR11","doi-asserted-by":"publisher","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.\u00a0260, 119\u2013138 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR12","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":"49_CR13","first-page":"598","volume-title":"Principles of Knowledge Representation and Reasoning, KR 04","author":"E. Pacuit","year":"2004","unstructured":"Pacuit, E., Salame, S.: Majority logic. In: Principles of Knowledge Representation and Reasoning, KR 04, pp. 598\u2013605. AAAI Press, Menlo Park (2004)"},{"key":"49_CR14","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":"49_CR15","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":"49_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, 149\u2013166 (2002)","journal-title":"J. Logic Comput."},{"key":"49_CR17","series-title":"ENTCS","volume-title":"Coalgebraic Methods in Computer Science","author":"M. R\u00f6\u00dfiger","year":"2000","unstructured":"R\u00f6\u00dfiger, M.: Coalgebras and modal logic. In: Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a033, Elsevier, Amsterdam (2000)"},{"key":"49_CR18","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":"49_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/978-3-540-31982-5_28","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Schr\u00f6der","year":"2005","unstructured":"Schr\u00f6der, L.: Expressivity of coalgebraic modal logic: the limits and beyond. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 440\u2013454. Springer, Heidelberg (Extended version to appear in Theoret. Comput. Sci.) (2005)"},{"key":"49_CR20","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 and ETAPS 2006. LNCS, vol.\u00a03921, pp. 157\u2013171. Springer, Heidelberg (Extended version to appear in J. Logic Algebraic Programming) (2006)"},{"key":"49_CR21","first-page":"231","volume-title":"Logic in Computer Science","author":"L. Schr\u00f6der","year":"2006","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE reasoning for rank-1 modal logics. In: Logic in Computer Science, pp. 231\u2013240. IEEE Computer Society Press, Los Alamitos (2006), Presentation slides available under \n                    \n                      http:\/\/www.informatik.uni-bremen.de\/~lschrode\/slides\/rank1pspace.pdf"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:11:58Z","timestamp":1605744718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_49","relation":{},"subject":[]}}