Hanf Number of Omitting Type for Simple First-Order Theories

Shelah, Saharon

Shelah, Saharon

J. Symbolic Logic, Tome 44 (1979) no. 1, p. 319-324 / Harvested from Project Euclid

Résumé

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.

Publié le : 1979-09-14
Classification:

@article{1183740428,
     author = {Shelah, Saharon},
     title = {Hanf Number of Omitting Type for Simple First-Order Theories},
     journal = {J. Symbolic Logic},
     volume = {44},
     number = {1},
     year = {1979},
     pages = { 319-324},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183740428}
}

Shelah, Saharon. Hanf Number of Omitting Type for Simple First-Order Theories. J. Symbolic Logic, Tome 44 (1979) no. 1, pp.  319-324. http://gdmltest.u-ga.fr/item/1183740428/