Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames
Logic
2023-06-26 v1
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.
Keywords
Cite
@article{arxiv.2306.13559,
title = {Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames},
author = {I. Agadzhanian and M. Rybakov and D. Shkatov},
journal= {arXiv preprint arXiv:2306.13559},
year = {2023}
}
Comments
Semantical and Computational Aspects of Non-Classical Logics (Moscow + Online, June 13-17, 2023), Steklov International Mathematical Center, Moscow, 2023