In this article, we present a modal logic that extends the basic ML with two dynamic operators: copy (cp), which replicates current model, labelling each different propositional symbol and respecting accessibility relations even between distinct copies; remove (rm), deletes paths in model satisfy certain intermediate conditions. We call resulting ML(cp,rm). study its computational complexity, r...
