{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:48:42Z","timestamp":1725738522890},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_12","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T09:09:19Z","timestamp":1372756159000},"page":"101-112","source":"Crossref","is-referenced-by-count":0,"title":["Coalgebraic Announcement Logics"],"prefix":"10.1007","author":[{"given":"Facundo","family":"Carreiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Gor\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Baltag, A.: A coalgebraic semantics for epistemic programs. In: Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a082, pp. 17\u201338. Elsevier (2003)","DOI":"10.1016\/S1571-0661(04)80630-3"},{"key":"12_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":"12_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-32254-2_16","volume-title":"Mechanizing Mathematical Reasoning","author":"J. Benthem van","year":"2005","unstructured":"van Benthem, J.: An essay on sabotage and obstruction. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS (LNAI), vol.\u00a02605, pp. 268\u2013276. Springer, Heidelberg (2005)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-73859-6_11","volume-title":"Algebra and Coalgebra in Computer Science","author":"C. C\u00eerstea","year":"2007","unstructured":"C\u00eerstea, C., Sadrzadeh, M.: Coalgebraic epistemic update without change of model. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 158\u2013172. Springer, Heidelberg (2007)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic epistemic logics. Springer (2007)","DOI":"10.1007\/978-1-4020-5839-4"},{"key":"12_CR6","unstructured":"Duque, D.F., van Benthem, J., Pacuit, E.: Evidence logic: a new look at neighborhood structures. In: Advances in Modal Logics. College Publications (2012)"},{"key":"12_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.Y.: Reasoning about knowledge and probability. J. ACM\u00a041, 340\u2013367 (1994)","journal-title":"J. ACM"},{"key":"12_CR8","unstructured":"French, T., van der Hoek, W., Iliev, P., Kooi, B.: Succinctness of epistemic languages. In: Int. Joint Conf. on Artif. Int., pp. 881\u2013886 (2011)"},{"key":"12_CR9","unstructured":"French, T., van Ditmarsch, H.: Undecidability for arbitrary public announcement logic. In: Advances in Modal Logics, pp. 23\u201342. College Publications (2008)"},{"key":"12_CR10","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":"12_CR11","unstructured":"Hintikka, J.: Knowledge and belief. Cornell University Press (1962)"},{"key":"12_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. Inf. Comput.\u00a094, 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-24597-1_26","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"C. L\u00f6ding","year":"2003","unstructured":"L\u00f6ding, C., Rohde, P.: Model checking and satisfiability for sabotage modal logic. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 302\u2013313. Springer, Heidelberg (2003)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Lutz, C.: Complexity and succinctness of public announcement logic. In: Joint Conference on Autonomous Agents and Multi-Agent Systems, pp. 137\u2013143 (2006)","DOI":"10.1145\/1160633.1160657"},{"key":"12_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."},{"key":"12_CR16","first-page":"2004","volume":"45","author":"D. Pattinson","year":"2002","unstructured":"Pattinson, D.: Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Logic\u00a045, 2004 (2002)","journal-title":"Notre Dame J. Formal Logic"},{"key":"12_CR17","unstructured":"Plaza, J.A.: Logics of public communications. In: International Symposium on Methodologies for Intelligent Systems, pp. 201\u2013216 (1989)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-30124-0_25","volume-title":"Computer Science Logic","author":"P. Rohde","year":"2004","unstructured":"Rohde, P.: Moving in a crumbling network: The balanced case. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 310\u2013324. Springer, Heidelberg (2004)"},{"key":"12_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":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-12032-9_23","volume-title":"Foundations of Software Science and Computational Structures","author":"L. Schr\u00f6der","year":"2010","unstructured":"Schr\u00f6der, L., Pattinson, D.: Coalgebraic correspondence theory. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 328\u2013342. Springer, Heidelberg (2010)"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1017\/S0960129510000563","volume":"21","author":"L. Schr\u00f6der","year":"2011","unstructured":"Schr\u00f6der, L., Pattinson, D.: Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra. Math. Struct. Comput. Sci.\u00a021(2), 235\u2013266 (2011)","journal-title":"Math. Struct. Comput. Sci."},{"key":"12_CR22","unstructured":"Segerberg, K.: An essay in classical modal logic. No. 1 in Filosofiska studier utgivna av Filosofiska f\u00f6reningen och Filosofiska institutionen vid Uppsala univ. (1971)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-540-72734-7_35","volume-title":"Logical Foundations of Computer Science","author":"D. Steiner","year":"2007","unstructured":"Steiner, D., Studer, T.: Total public announcements. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 498\u2013511. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:28:14Z","timestamp":1557898094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}