This paper is concerned with extending some basic results from classical model theory to modal logic.
In §1, we define the majority of terms used in the paper, and explain our notation. A full catalogue would be excessive, and we cite  and  as general references.
Many papers on modal logic that have appeared are concerned with (i) introducing a new modal logic, and (ii) proving a weak completeness theorem for it. Theorem 1, in §2, in many cases allows us to conclude immediately that a strong completeness theorem holds for such a logic in languages of arbitrary cardinality. In particular, this is true of S4 with the Barcan formula.
In §3 we strengthen Theorem 1 for a number of modal logics to deal with the satisfaction of several sets of sentences, and so obtain a realizing types theorem. Finally, an omitting types theorem, generalizing the result for classical logic (see ) is proved in §4.
Several consequences of Theorem 1 are already to be found in the literature.  gives a proof of strong completeness in languages of arbitrary cardinality of various logics without the Barcan formula, and  for some logics in countable languages with it. In the latter case, the result for uncountable languages is cited, without proof, in , and there credited to Montague. Our proof was found independently.