Decidability of Being a Union-splitting
Logic
2025-10-17 v1
Abstract
Many logical properties are known to be undecidable for normal modal logics, with few exceptions such as consistency and coincidence with . This paper shows that the property of being a union-splitting in , 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 , having a decidable axiomatization problem and being a (un)decidable formula are also decidable. The latter answers [CZ97, Problem 17.3] for .
Keywords
Cite
@article{arxiv.2510.14520,
title = {Decidability of Being a Union-splitting},
author = {Tenyo Takahashi},
journal= {arXiv preprint arXiv:2510.14520},
year = {2025}
}
Comments
14 pages