In this paper we introduce a language of first-order hybrid logic in which function symbols are interpreted by partial functions and prove a number of completeness results. Syntactically, our language builds on the basic propositional hybrid language, has a primitive unary predicate symbol DEN which tests whether a term denotes or not, and permits satisfaction operators to rigidify predicate and function symbols. Semantically, our system is actualist, allows terms to be undefined, and has no truth-value gaps. But should we follow Fitting and Mendelsohn and rule out domain elements not belonging to any world, or should we tolerate them? Here we explore both options. As we shall see, while the choice makes no difference when it comes to validity, it has consequences for richer logics.