Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames

TL;DR

This paper analyzes the computational complexity of monadic multimodal predicate logics with equality over finite Kripke frames, providing precise bounds for classes with finitely many worlds.

Contribution

It establishes exact complexity bounds for monadic predicate logics over finite Kripke frames, advancing understanding of their computational properties.

Findings

Derived precise complexity bounds for monadic logics over finite frames

Identified complexity differences based on frame classes

Enhanced theoretical understanding of modal predicate logic complexity

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.