We consider compactness characterizations of large cardinals. Based on results of Benda [Ben78], we study compactness for omitting types in various logics. In Lκ,κ, this allows us to characterize any large cardinal defined in terms of normal ultrafilters, and we also analyze second-order and sort logic. In particular, we give a compactness for omitting types characterization of huge cardinals, which have consistency strength beyond Vopěnka's Principle.Fact 1.2. κ is measurable iff every theory T ⊂ L κ,κ that can be written as a union of an increasing κ-sequence of satisfiable theories is itself satisfiable.Magidor [Mag71, Theorem 4] showed that extendible cardinals are the compactness cardinals of second-order logic, and Makowsky [Mak85] gives an over-arching result that Vopěnka's Principle is equivalent to the existence of a compactness cardinal for every logic (see Fact 3.12 below). This seems to situate Vopěnka's Principle as an upper bound to the strength of cardinals that can be reached by compactness characterizations.However, this is not the case. Instead, a new style of compactness is needed, which we call compactness for omitting types (Definition 3.4). Recall that a type p(x) in a logic L is a collection of L-formulas in free variable x. A model M realizes p if there is a ∈ M realizing every formula This is based on the author's personal impressions. Although the statement seems forgotten, the proof is standard: if T = ∪α<κTα and Mα Tα, then set Mκ := Mα/U for any κ-complete, nonprincipal ultrafilter U on κ. Loś' Theorem for Lκ,κ implies Mκ T .12 Here meant as 'sublogics of L∞,∞.' 13 The notion of "elementary substructure" does appear here, but always in reference to its first-order version.