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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

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

On the Hanf number of souslin logic.John P. Burgess - 1978 - Journal of Symbolic Logic 43 (3):568-571.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Model completions and omitting types.Terrence Millar - 1995 - Journal of Symbolic Logic 60 (2):654-672.
Hanf numbers for omitting types over particular theories.Julia F. Knight - 1976 - Journal of Symbolic Logic 41 (3):583-588.
Omitting types in incomplete theories.Enrique Casanovas & Rafel Farré - 1996 - Journal of Symbolic Logic 61 (1):236-245.
Proof normalization modulo.Gilles Dowek & Benjamin Werner - 2003 - Journal of Symbolic Logic 68 (4):1289-1316.

Analytics

Added to PP
2009-01-28

Downloads
222 (#91,816)

6 months
6 (#530,055)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.

Add more references