Omitting types theorem

ID: omitting-types-theorem

Let be a consistent theory in a countable first-order language. For every countable family of nonisolated finite-arity types of , there is a countable model of that omits every type in the family.

New to topics? Read the docs here!