Copy and remove as dynamic operators

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