Modal definability in Euclidean modal logics
Modal definability in Euclidean modal logics
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.
Philippe Balbiani、Tinko Tinchev
计算技术、计算机技术
Philippe Balbiani,Tinko Tinchev.Modal definability in Euclidean modal logics[EB/OL].(2025-08-14)[2025-08-24].https://arxiv.org/abs/2508.10813.点此复制
评论