Hanf number of omitting type for simple first-order theories

Journal of Symbolic Logic 44 (3):319-324 (1979)
  Copy   BIBTEX

Abstract

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 $ 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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,854

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

End extensions and numbers of countable models.Saharon Shelah - 1978 - Journal of Symbolic Logic 43 (3):550-562.
An omitting types theorem for saturated structures.A. D. Greif & M. C. Laskowski - 1993 - Annals of Pure and Applied Logic 62 (2):113-118.
Vaught’s Conjecture for Theories of Discretely Ordered Structures.Predrag Tanović - 2024 - Notre Dame Journal of Formal Logic 65 (3):247-257.
The spectrum of resplendency.John T. Baldwin - 1990 - Journal of Symbolic Logic 55 (2):626-636.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Model theory without choice? Categoricity.Saharon Shelan - 2009 - Journal of Symbolic Logic 74 (2):361-401.
The Hanf number in the strictly stable case.Saharon Shelah - 2020 - Mathematical Logic Quarterly 66 (3):280-294.

Analytics

Added to PP
2009-01-28

Downloads
233 (#112,579)

6 months
11 (#364,844)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations