Aucher, Guillaume, van Benthem, Johan and Grossi, Davide 
ORCID: 0000-0002-9709-030X
(2018)
Modal logics of sabotage revisited.
.
|
Text
RevisedProof.pdf - Author Accepted Manuscript Download (834kB) | Preview |
Abstract
Sabotage modal logic was proposed in 2003 as a format for analysing games that modify graphs they are played on. We investigate some model-theoretic and proof-theoretic aspects of sabotage modal logic, which has come to be viewed as an early dynamic logic of graph change. Our first result is a characterization theorem for sabotage modal logic as a fragment of first-order logic which is invariant with respect to a natural notion of ‘sabotage bisimulation’. Next, we offer a sound and complete tableau method and its associated labelled sequent calculus for analysing reasoning in sabotage modal logic. Finally, we identify and briefly explore a number of open research problems concerning sabotage modal logic that illuminate its complexity, placing it within the current landscape of modal logics that analyse model update, and, returning to the original motivation of sabotage, fixed-point logics for network games.
| Item Type: | Conference or Workshop Item (Unspecified) |
|---|---|
| Uncontrolled Keywords: | Modal logic, dynamic logic, graph change, fixed-point logic |
| Depositing User: | Symplectic Admin |
| Date Deposited: | 27 Feb 2020 14:27 |
| Last Modified: | 18 Jan 2023 23:59 |
| DOI: | 10.1093/logcom/exx034 |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3076912 |
Dimensions
Dimensions
