Copy and remove as dynamic operators.

In this article, we present a modal logic that extends the basic modal logic M L with two dynamic operators: copy ( c p ), which replicates the current model, labelling each copy with a different propositional symbol and respecting accessibility relations even between distinct copies; and remove ( r m ), which deletes paths in the model that satisfy certain intermediate conditions. We call the resulting logic M L (c p , r m). We study its computational complexity, and its relative expressivity with respect to (static) modal logics M L and M L (◻ −) , and the dynamic epistemic Action Model Logic, A M L . [ABSTRACT FROM AUTHOR]