Diamonds and Dominoes: Impossibility Results for Associative Modal Logics
Logic
2025-06-23 v1
Abstract
We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, any associative normal modal logic valid over the frame (P(N), U) is undecidable. This settles a long-open question on the decidability of hyperboolean modal logic (Goranko and Vakarelov, 1999), and addresses several related problems.
Cite
@article{arxiv.2506.16366,
title = {Diamonds and Dominoes: Impossibility Results for Associative Modal Logics},
author = {Søren Brinck Knudstorp},
journal= {arXiv preprint arXiv:2506.16366},
year = {2025}
}
Comments
26 pages