Natural deduction for first-order hybrid logic

Abstract

This is a companion paper to Braüner (2004b, Journal of Logic and Computation 14, 329-353) where a natural deduction system for propositional hybrid logic is given. In the present paper we generalize the system to the first-order case. Our natural deduction system for first-order hybrid logic can be extended with additional inference rules corresponding to conditions on the accessibility relations and the quantifier domains expressed by so-called geometric theories. We prove soundness and completeness and we prove a normalisation theorem. Moreover, we give an axiom system first-order hybrid logic. © Springer 2005.