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

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 space, dually, a finite modal algebra, that serves as a finite countermodel of such rules, yielding the fmp. We apply the Subdivision Construction to prove the fmp for logics and rule systems axiomatized by stable canonical formulas and rules of finite modal algebras of finite height. As a consequence, we identify a class of union-splittings in NExt(K4) with degree of Kripke incompleteness 1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…