An essay in combinatory dynamic logic
Information and Computation
Annals of Mathematics and Artificial Intelligence
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Decidable Navigation Logics for Object Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Sequent calculi and decidability for intuitionistic hybrid logic
Information and Computation
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
Hi-index | 0.00 |
Hybrid logics were proposed in [15] as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as formulae. In addition, hybrid logics may contain quantifiers to bind the labels. Thus, hybrid logics have both Kripke semantics and a first-order binding apparatus. We present prefixed tableau calculi for weak hybrid logics (proper fragments of classical logic) as well as for hybrid logics having full first-order expressive power, and give a general method for proving completeness. For the weak quantifier-free logics we present a tableau-based decision procedure.