An omitting types theorem for saturated structures

Annals of Pure and Applied Logic 62 (2):113-118 (1993)
  Copy   BIBTEX

Abstract

We define a new topology on the space of strong types of a given theory and use it to state an omitting types theorem for countably saturated models of the theory. As an application we show that if T is a small, stable theory of finite weight such that every elementary extension of the countably saturated model is ω-saturated then every weakly saturated model is ω-saturated

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Models Omitting Given Complete Types.Akito Tsuboi - 2008 - Notre Dame Journal of Formal Logic 49 (4):393-399.
Hanf number of omitting type for simple first-order theories.Saharon Shelah - 1979 - Journal of Symbolic Logic 44 (3):319-324.
Model completions and omitting types.Terrence Millar - 1995 - Journal of Symbolic Logic 60 (2):654-672.
Neat Embeddings, Omitting Types, and Interpolation: An Overview.Tarek Sayed Ahmed - 2003 - Notre Dame Journal of Formal Logic 44 (3):157-173.
A new omitting types theorem for l(q).Matt Kaufmann - 1979 - Journal of Symbolic Logic 44 (4):507-521.
Forcing and the Omitting Types Theorem For Lt.W. Sachwanowicz - 1986 - Mathematical Logic Quarterly 32 (6):89-94.
Omitting types in incomplete theories.Enrique Casanovas & Rafel Farré - 1996 - Journal of Symbolic Logic 61 (1):236-245.

Analytics

Added to PP
2014-01-16

Downloads
18 (#811,325)

6 months
5 (#629,136)

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

Countable models of 1-based theories.Anand Pillay - 1992 - Archive for Mathematical Logic 31 (3):163-169.

Add more references