  In this paper we prove a Robinson consistency theorem for a class of
many-sorted hybrid logics as a consequence of an Omitting Types Theorem. An
important corollary of this result is an interpolation theorem.
