PP-2016-28: Modal Logics of Sabotage Revisited

PP-2016-28: Aucher, Guillaume and and Davide Grossi, Johan van Benthem (2016) Modal Logics of Sabotage Revisited. [Report]

There is a more recent version of this item available.
[thumbnail of Full Text]
Text (Full Text)

Download (495kB) | Preview
[thumbnail of Abstract] Text (Abstract)

Download (1kB)


Sabotage modal logic was proposed in 2003 as a format for analyzing games that modify the graphs they are played on. We investigate some model-theoretic and proof-theoretic aspects of sabotage modal logic, which has largely come to be viewed as an early dynamic logic of graph change. Our first contribution 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’. Our second contribution is a sound and complete tableau method for analyzing 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 analyze model update (including new `stepwise' variants of dynamic-epistemic logics), and, returning to the original motivation of sabotage, fixed-point logics for network games.

Note: This is an extended version of a paper presented at LORI Taipei 2015, which will appear in the "Knowledge and Rationality" subseries of "Synthese".

Item Type: Report
Report Nr: PP-2016-28
Series Name: Prepublication (PP) Series
Year: 2016
Uncontrolled Keywords: sabotage game, graph games, modal logic, model change, complexity, dynamic-epistemic logic
Subjects: Logic
Depositing User: Johan van Benthem
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/564

Available Versions of this Item

Actions (login required)

View Item View Item