Two Natural Deduction Systems for Hybrid Logic: A Comparison
Journal of Logic, Language and Information
Natural Deduction for First-Order Hybrid Logic
Journal of Logic, Language and Information
A Two-Dimensional Hybrid Logic of Subset Spaces
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Type-safe higher-order channels with channel locality1
Journal of Functional Programming
International Journal of Advanced Intelligence Paradigms
Hybrid logical analyses of the ambient calculus
Information and Computation
Intuitionistic hybrid logic: Introduction and survey
Information and Computation
Sequent calculi and decidability for intuitionistic hybrid logic
Information and Computation
A modal language for the safety of mobile values
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
| Hi-index | 0.00 |
In this paper we give a natural deduction formulation of hybrid logic. Our natural deduction system can be extended with additional inference rules corresponding to conditions on the accessibility relations expressed by so-called geometric theories. Thus, we give natural deduction systems in a uniform way for a wide class of hybrid logics which appears to be impossible in the context of ordinary modal logic. We prove soundness and completeness and we prove a normalization theorem. We finally prove a result which says that normal derivations in the natural deduction system correspond to derivations in a cut-free Gentzen system.