A test for expandability

Archive for Mathematical Logic 37 (4):221-234 (1998)
  Copy   BIBTEX

Abstract

A model $M$ of countable similarity type and cardinality $\kappa$ is expandable if every consistent extension $T_{1}$ of its complete theory with $|T_{1}|\leq \kappa$ is satisfiable in $M$ and it is compactly expandable if every such extension which additionally is finitely satisfiable in $M$ is satisfiable in $M$ . In the countable case and in the case of a model of cardinality $\geq 2^{\omega}$ of a superstable theory without the finite cover property the notions of saturation, expandability and compactness for expandability agree. The question of the existence of compactly expandable models which are not expandable is open. Here we present a test which serves to prove that a compactly expandable model of cardinality $\geq 2^{\omega}$ of a superstable theory is expandable. It is stated in terms of the existence of a certain elementary submodel whose corresponding theory of pairs of models satisfies a weak elimination of Ramsey quantifiers

Links

PhilArchive



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

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

Compactly expandable models and stability.Enrique Casanovas - 1995 - Journal of Symbolic Logic 60 (2):673-683.
Models of set theory with definable ordinals.Ali Enayat - 2005 - Archive for Mathematical Logic 44 (3):363-385.
End extensions and numbers of countable models.Saharon Shelah - 1978 - Journal of Symbolic Logic 43 (3):550-562.
Rich models.Michael H. Albert & Rami P. Grossberg - 1990 - Journal of Symbolic Logic 55 (3):1292-1298.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.
The stability function of a theory.H. Jerome Keisler - 1978 - Journal of Symbolic Logic 43 (3):481-486.
Hanf number of omitting type for simple first-order theories.Saharon Shelah - 1979 - Journal of Symbolic Logic 44 (3):319-324.
Power-like models of set theory.Ali Enayat - 2001 - Journal of Symbolic Logic 66 (4):1766-1782.
Limit ultrapowers and abstract logics.Paolo Lipparini - 1987 - Journal of Symbolic Logic 52 (2):437-454.

Analytics

Added to PP
2013-12-01

Downloads
13 (#950,112)

6 months
5 (#441,012)

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

Compactly expandable models and stability.Enrique Casanovas - 1995 - Journal of Symbolic Logic 60 (2):673-683.

Add more references