Score: 0

Modal definability in Euclidean modal logics

Published: August 14, 2025 | arXiv ID: 2508.10813v1

By: Philippe Balbiani, Tinko Tinchev

Potential Business Impact:

Makes computers understand logic puzzles better.

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.

Country of Origin
🇧🇬 Bulgaria

Page Count
52 pages

Category
Computer Science:
Logic in Computer Science