 Corollary 23. Löwenheim-Skolem Theorem. Let \(\Gamma\) be a satisfiable set of sentences of the language \(\LKe\). If \(\Gamma\) is either finite or denumerably infinite, then \(\Gamma\) has a model whose domain is either finite or denumerably infinite. 