Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames
From MaRDI portal
Publication:6441271
Abstract: 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.
This page was built for publication: Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6441271)
