Omitting Types in Incomplete Theories
暂无分享,去创建一个
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 K non-isolated types. As a consequence we prove that omissibility of a family of K types is equivalent to omissibility of each countable subfamily.
[1] Ludomir Newelski. Omitting Types and the Real Line , 1987, J. Symb. Log..
[2] H. Simmons. An Omitting Types Theorem with an Application to the Construction of Generic Structures. , 1973 .