Losing Connection: Modal Logic of Definable Link Deletion

by   Dazhu Li, et al.

We consider a natural variant of Sabotage Game. Different to the action of Blocker in a sabotage game, links are cut in a local, definable and uniform way, where local is used as usual; definable means that links are cut based on some considerations on the properties of the nodes in the graph; and uniform shows that it is permitted to cut more links than one in each round. As what we will see, this variant can model some interesting scenarios in everyday life. After this, a suitable modal logic is presented to characterize the game. First, we provide some preliminaries for it, including syntax, semantics and some validities. Next, we describe the standard translation and its correctness. Then, an appropriate notion of bisimulation is proposed for the logic introduced. Afterwards, we show a characterization theorem for the logic as a fragment of first-order logic that is invariant for the bisimulation, and investigate its expressive power. Further more, we prove that the logic is also a fragment of some hybrid logics, and provide some considerations on the recursion axioms. Finally, we show that the logic lacks the tree model property and the finite model property,and that the satisfiability problem for it is undecidable.


page 1

page 2

page 3

page 4


Losing Connection:the Modal Logic of Definable Link Deletion

In this article, we start with a two-player game that models communicati...

Satisfiability problems on sums of Kripke frames

We consider the operation of sum on Kripke frames, where a family of fra...

The Finite Model Property of Quasi-transitive Modal Logic

The finite model property of the quasi-transitive modal logic K_2^3=K⊕ p...

Many-Sorted Hybrid Modal Languages

We continue our investigation into hybrid polyadic multi-sorted logic wi...

The Modal Logic of Stepwise Removal

We investigate the modal logic of stepwise removal of objects, both for ...

A New Game Equivalence and its Modal Logic

We revisit the crucial issue of natural game equivalences, and semantics...

Expressive power versus decidability

In this note we prove that there exists no fragment of first-order logic...

Please sign up or login with your details

Forgot password? Click here to reset