Modal definability in Euclidean modal logics
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.
Similar Papers
Quantum modal logic
Logic in Computer Science
Makes computers think with quantum rules.
Complexity of Łukasiewicz Modal Probabilistic Logics
Logic in Computer Science
Helps computers reason about uncertain ideas.
Intuitionistic modal logic LIK4 is decidable
Logic in Computer Science
Lets computers know if a statement is definitely true.