Abstract

We characterize omissibility of a type, or a family of types, in a countable theory in terms of non-existence of a certain tree of formulas. We extend results of L. Newelski on omitting $ non-isolated types. As a consequence we prove that omissibility of a family of $ types is equivalent to omissibility of each countable subfamily