“…Our notation itself has a long history (see for example [10,11,19]), and has the benefit of descriptiveness: κ is L µ,ω -compact if and only if for every set T of sentences in the language L µ,ω (or indeed L µ,µ ), if every subset of T of cardinality less than κ is satisfiable, then T is satisfiable. Our notation is perhaps cumbersome when λ is specified, and for this general case Boney and Unger's proposal "(µ, λ)-strong compactness" [8] might be a better solution, but since we shall never need to specify λ, our "L µ,ω -compact" seems a more elegant choice than their "(µ, ∞)strongly compact".…”