A Tableau system for a first-order hybrid logic
In this paper a first-order version of hybrid logic is presented. The language is obtained by adding nominals, satisfaction operators and the down-arrow binder to classical first-order modal logic (including constants and function symbols). The satisfaction operators are applied to both formulas and terms. Moreover adding the universal modality is discussed. This first-order hybrid language is int