  Recall from §4 that we may code the formulas of a first-order language  L  as hereditarily finite sets, i.e., as members of H(ω). In that case each finite set of (codes of)  L-sentences  is also a member of H(ω), and it follows that the compactness theorem for  L  can be stated in the form: