  The paper investigates algorithmic complexity of monadic multimodal predicate
logics with equality over finite Kripke frames or classes of finite Kripke
frames. Precise complexity bounds for monadic logics of classes of Kripke
frames with finitely many possible worlds are obtained.
