For Lemma 3.6(a) (existence of l-constructible models), the language must be
assumed to be countable.