A model of consists of a model and automorphisms
such that and whenever . Thus is an injective homomorphism . Conversely, any such embedding supplies interpretations of the and hence a model of .
Therefore is -good exactly when has a model. By part (b), this is equivalent to consistency of , and hence
Suppose is inconsistent. By the compactness theorem, some finite subset is inconsistent. Only finitely many added symbols occur in ; let be the finite set of their indices. Every sentence of belongs to the sublanguage , so
Consequently is inconsistent.
If is inconsistent for some finite , then its superset is inconsistent. Together with parts (i) and (ii), this proves the equivalence of all three conditions.

Articles by others on the same topic (0)

There are currently no matching articles.