{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:50:59Z","timestamp":1775735459917,"version":"3.50.1"},"reference-count":40,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"Tsinghua University Initiative Scientific Research Program","award":["2017THZWYX08"],"award-info":[{"award-number":["2017THZWYX08"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In this article, we start with a two-player game that models communication under adverse circumstances in everyday life and study it from the perspective of a modal logic of graphs, where links can be deleted locally according to definitions available to the adversarial player. We first introduce a new language, semantics and some typical validities. We then formulate a new type of first-order translation for this modal logic and prove its correctness. Then, a novel notion of bisimulation is proposed that leads to a characterization theorem for the logic as a fragment of first-order logic, and a further investigation is made of its expressive power against hybrid modal languages. Next, we discuss how to axiomatize this logic of link deletion, using dynamic-epistemic logics as a contrast. Finally, we show that our new modal logic lacks both the tree model property and the finite model property and that its satisfiability problem is undecidable.<\/jats:p>","DOI":"10.1093\/logcom\/exz036","type":"journal-article","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T20:11:44Z","timestamp":1574885504000},"page":"715-743","source":"Crossref","is-referenced-by-count":12,"title":["Losing connection: the modal logic of definable link deletion"],"prefix":"10.1093","volume":"30","author":[{"given":"Dazhu","family":"Li","sequence":"first","affiliation":[{"name":"Department of Philosophy Tsinghua University, Beijing and Institute for Logic, Language and Computation University of Amsterdam, P.O. Box 94242, 1090 GE Amsterdam, The Netherlands"}]}],"member":"286","published-online":{"date-parts":[[2020,4,15]]},"reference":[{"key":"2020050200393194300_ref1","first-page":"15","article-title":"Hybrid logics: the old and the new","volume-title":"Proceedings of LogKCA-07","author":"Areces","year":"2007"},{"key":"2020050200393194300_ref2","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-642-32621-9_11","article-title":"Moving Arrows and Four Model Checking Results","volume-title":"Logic, Language, Information and Computation (WoLLIC 2012)","author":"Areces","year":"2012"},{"key":"2020050200393194300_ref3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1093\/jigpal\/jzt030","article-title":"Swap logic","volume":"22","author":"Areces","year":"2014","journal-title":"Logic Journal of the IGPL"},{"key":"2020050200393194300_ref4","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1093\/jigpal\/jzv020","article-title":"Relation-changing modal operators","volume":"23","author":"Areces","year":"2015","journal-title":"Logic Journal of the IGPL"},{"key":"2020050200393194300_ref5","doi-asserted-by":"crossref","first-page":"16","DOI":"10.4204\/EPTCS.226.2","article-title":"Relation-changing logics as fragments of hybrid logics","volume":"226","author":"Areces","year":"2016","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"2020050200393194300_ref6","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1093\/logcom\/exy022","article-title":"Satisfiability for relation-changing Logics","volume":"28","author":"Areces","year":"2018","journal-title":"Journal of Logic and Computation"},{"key":"2020050200393194300_ref7","first-page":"821","article-title":"Hybrid logics","volume-title":"Handbook of Modal Logic","author":"Areces","year":"2006"},{"key":"2020050200393194300_ref8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.entcs.2009.02.042","article-title":"Global and local graph modifiers","volume":"231","author":"Aucher","year":"2009","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"2020050200393194300_ref9","first-page":"1","article-title":"Sabotage modal logic: some model and proof theoretic aspects","volume-title":"Proceedings of LORI 2015","author":"Aucher","year":"2015"},{"key":"2020050200393194300_ref10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1093\/logcom\/exx034","article-title":"Modal logics of sabotage revisited","volume":"28","author":"Aucher","year":"2018","journal-title":"Journal of Logic and Computation"},{"key":"2020050200393194300_ref11","first-page":"43","article-title":"The logic of public announcements and common knowledge and private suspicions","volume-title":"Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 1998)","author":"Baltag","year":"1998"},{"key":"2020050200393194300_ref12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11225-017-9723-2","article-title":"Bisimulation for conditional modalities","volume":"106","author":"Baltag","year":"2018","journal-title":"Studia Logica"},{"key":"2020050200393194300_ref13","first-page":"28","article-title":"A logic for global and local announcements","volume-title":"Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2017)","author":"Belardinelli","year":"2017"},{"key":"2020050200393194300_ref14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-94-009-6259-0_4","article-title":"Correspondence theory","volume-title":"Handbook of Philosophical Logic: Volume II: Extensions of Classical Logic","author":"van Benthem","year":"1984"},{"key":"2020050200393194300_ref15","volume-title":"Modal Logic for Open Minds","author":"van Benthem","year":"2010"},{"key":"2020050200393194300_ref16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511974533","volume-title":"Logical Dynamics of Information and Interaction","author":"van Benthem","year":"2011"},{"key":"2020050200393194300_ref17","volume-title":"Logic in Games","author":"van Benthem","year":"2013"},{"key":"2020050200393194300_ref18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3166\/jancl.17.157-182","article-title":"Dynamic logic of preference upgrade","volume":"17","author":"van Benthem","year":"2007","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"2020050200393194300_ref19","first-page":"131","article-title":"Graph games and logic design","volume-title":"Tsinghua University Journal","author":"van Benthem","year":"2019"},{"key":"2020050200393194300_ref20","volume-title":"The Logic of Stepwise Removal","author":"van Benthem","year":"2019"},{"key":"2020050200393194300_ref21","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01049415","article-title":"Hybrid languages","volume":"4","author":"Blackburn","year":"1995","journal-title":"Journal of Logic, Language and Information"},{"key":"2020050200393194300_ref22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"Blackburn","year":"2001"},{"key":"2020050200393194300_ref23","first-page":"339","article-title":"On the complexity of hybrid logics with binders","volume-title":"Proceedings of Computer Science Logic 2005","author":"ten Cate","year":"2005"},{"key":"2020050200393194300_ref24","volume-title":"Model Theory","author":"Chang","year":"1973"},{"key":"2020050200393194300_ref25","doi-asserted-by":"crossref","first-page":"375","DOI":"10.3166\/jancl.21.375-395","article-title":"Some remarks on the model theory of epistemic plausibility models","volume":"21","author":"Demey","year":"2011","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"2020050200393194300_ref26","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0012-365X(93)90496-G","article-title":"Kernels in directed graphs: a poison game","volume":"115","author":"Duchet","year":"1993","journal-title":"Discrete Mathematics"},{"key":"2020050200393194300_ref27","article-title":"Relation-Changing Modal Logics","author":"Fervari","year":"2014"},{"key":"2020050200393194300_ref28","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-540-78127-1_17","article-title":"Introducing Reactive Kripke Semantics and Arc Accessibility","volume-title":"Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday","author":"Gabbay","year":"2008"},{"key":"2020050200393194300_ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-41389-6","volume-title":"Reactive Kripke Semantics","author":"Gabbay","year":"2013"},{"key":"2020050200393194300_ref30","first-page":"119","article-title":"Learning and teaching as a game: a sabotage approach","volume-title":"Proceedings of LORI 2009","author":"Gierasimczuk","year":"2009"},{"key":"2020050200393194300_ref31","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.entcs.2011.06.011","article-title":"A hybrid public announcement logic with distributed knowledge","volume":"273","author":"Hansen","year":"2011","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"2020050200393194300_ref32","first-page":"51","article-title":"Recurring dominoes: making the highly undecidable highly understandable","volume":"24","author":"Harel","year":"1985","journal-title":"Annals of Discrete Mathematics"},{"key":"2020050200393194300_ref33","author":"Hoffmann","year":"2015"},{"key":"2020050200393194300_ref34","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1007\/s11229-014-0432-3","article-title":"Logical dynamics of belief change in the community","volume":"191","author":"Liu","year":"2014","journal-title":"Synthese"},{"key":"2020050200393194300_ref35","first-page":"302","article-title":"Model Checking and Satisfiability for Sabotage Modal Logic","volume-title":"Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003)","author":"L\u00f6ding","year":"2003"},{"key":"2020050200393194300_ref36","article-title":"Modal Memory Logics","volume-title":"PhD Thesis, Universidad de Buenos Aires and Universit\u00e9 Henri Poincar\u00e9","author":"Mera","year":"2009"},{"key":"2020050200393194300_ref37","article-title":"On Games and Logics over Dynamically Changing Structures","author":"Rohde","year":"2005"},{"key":"2020050200393194300_ref38","article-title":"The modal logics of the Poison game","volume-title":"Knowledge, Proof and Dynamics","author":"Zaffora Blando","year":"2019"},{"key":"2020050200393194300_ref39","first-page":"229","article-title":"Facebook and the epistemic logic of friendship","volume-title":"Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013)","author":"Seligman","year":"2013"},{"key":"2020050200393194300_ref40","article-title":"Local fact change logic","volume-title":"Knowledge, Proof and Dynamics","author":"Thompson","year":"2019"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/3\/715\/33154059\/exz036.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/30\/3\/715\/33154059\/exz036.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,2]],"date-time":"2020-05-02T04:40:35Z","timestamp":1588394435000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/30\/3\/715\/5820068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":40,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,4,15]]},"published-print":{"date-parts":[[2020,4,20]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exz036","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2020,4]]},"published":{"date-parts":[[2020,4]]}}}