Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 44, Issue 3 (1979), 319-324.
Hanf Number of Omitting Type for Simple First-Order Theories
Let $T$ be a complete countable first-order theory such that every ultrapower of a model of $T$ is saturated. If $T$ has a model omitting a type $p$ in every cardinality $< \beth_\omega,$ then $T$ has a model omitting $p$ in every cardinality. There is also a related theorem, and an example showing the $\beth_\omega$ cannot be improved.
J. Symbolic Logic, Volume 44, Issue 3 (1979), 319-324.
First available in Project Euclid: 6 July 2007
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Shelah, Saharon. Hanf Number of Omitting Type for Simple First-Order Theories. J. Symbolic Logic 44 (1979), no. 3, 319--324. https://projecteuclid.org/euclid.jsl/1183740428