Modal definability in Euclidean modal logics

2025/08/14 by Balbiani, Philippe, Tinchev, Tinko
#FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2508.10813

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.

Related

• Frame definability in finitely-valued modal logics
• A Simplest Undecidable Modal Logic
• Characterising Modal Definability of Team-Based Logics via the Universal Modality
• First-Order Modal Logic: Frame Definability and Lindström Theorems
• Characterizing Relative Frame Definability in Team Semantics via the Universal Modality