Decidability of Being a Union-splitting
Abstract
Many logical properties are known to be undecidable for normal modal logics, with few exceptions such as consistency and coincidence with K. This paper shows that the property of being a union-splitting in NExtK, the lattice of normal modal logics, is decidable, thus answering the open problem [WZ07, Problem 2]. This is done by providing a semantic characterization of union-splittings in terms of finite modal algebras. Moreover, by clarifying the connection to union-splittings, we show that in NExtK, having a decidable axiomatization problem and being a (un)decidable formula are also decidable. The latter answers [CZ97, Problem 17.3] for NExtK.
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.