On partitioning Kripke frames of finite height

Andrey Kudinov; Ilya Shapirovsky

On partitioning Kripke frames of finite height

Logic 2015-12-01 v1

Authors: Andrey Kudinov , Ilya Shapirovsky

Abstract

The paper proves finite model property and decidability for a family of modal logics. A binary relation $R$ is called pretransitive, if $R^*=\cup_{i\leq m} R^i$ for some $m\geq 0$ , where $R^*$ is the transitive reflexive closure of $R$ . By the height of $(W,R)$ we mean the height of the preorder $(W,R^*)$ . Special partitionings (filtrations) are described for pretransitive frames of finite height, which implies finite model property and decidability of logics of these frames.

Keywords

modal logics finite model property decidability Kripke frames pretransitive frames filtrations finite height

Cite

@article{arxiv.1511.09092,
  title  = {On partitioning Kripke frames of finite height},
  author = {Andrey Kudinov and Ilya Shapirovsky},
  journal= {arXiv preprint arXiv:1511.09092},
  year   = {2015}
}

Comments

In Russian. 35 pages

On partitioning Kripke frames of finite height

Abstract

Keywords

Cite

Comments

Related papers