2000 character limit reached
Modal definability in Euclidean modal logics
Published 14 Aug 2025 in cs.LO and math.LO | (2508.10813v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.