Article contents
Omitting types in incomplete theories
Published online by Cambridge University Press: 12 March 2014
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 < covK non-isolated types. As a consequence we prove that omissibility of a family of < covK types is equivalent to omissibility of each countable subfamily.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1996
References
REFERENCES
- 6
- Cited by