A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Complexity of hybrid logics over transitive frames
2010
Journal of Applied Logic
This article examines the complexity of hybrid logics over transitive frames, transitive trees, and linear frames. We show that satisfiability over transitive frames for the hybrid language extended with the downarrow operator ↓ is NEXPTIME-complete. This is in contrast to undecidability over arbitrary frames (Areces et al. (1999) [2]). We also show that adding the @ operator or the past modality leads to undecidability over transitive frames. This is again in contrast to the case of transitive
doi:10.1016/j.jal.2010.08.004
fatcat:ahls6o6bgvcetpqgtqkj5syfbm