Modal definability in Euclidean modal logics
Logic in Computer Science
2025-08-15 v1 Logic
Abstract
This paper is about the computability of the modal definability problem in classes of frames determined by Euclidean modal logics. We characterize those Euclidean modal logics such that the classes of frames they determine give rise to an undecidable modal definability problem.
Keywords
Cite
@article{arxiv.2508.10813,
title = {Modal definability in Euclidean modal logics},
author = {Philippe Balbiani and Tinko Tinchev},
journal= {arXiv preprint arXiv:2508.10813},
year = {2025}
}