Chopping More Finely: Finite Countermodels in Modal Logic via the Subdivision Construction

TL;DR

A new method is presented, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems axiomatized by stable canonical formulas and rules of finite modal algebras of finite height.

Abstract

We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and produces a finite modal algebra (finite modal space) that will be a finite countermodel of such rules, yielding the fmp. We apply the Subdivision Construction for proving the fmp for logics and rule systems axiomatized by stable canonical formulas and rules of finite modal algebras of finite height. We also observe that these logics and rule systems are union-splittings in corresponding lattices. As a consequence, we identify a class of union-splittings in $\mathsf{NExt}(\mathsf{K4})$ with the degree of Kripke incompleteness 1.

Figures (8)

• Figure 1: One step of the Subdivision Construction.
• Figure :
• Figure :
• Figure :
• Figure :

Theorems & Definitions (86)

• Theorem 2.1
• Definition 2.2
• Definition 2.3
• Definition 2.5
• Definition 2.6
• Theorem 2.7
• Definition 2.8
• Theorem 2.9
• Theorem 2.10
• Definition 2.11