Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-25T03:57:48.720Z Has data issue: false hasContentIssue false

Examples in the theory of existential completeness

Published online by Cambridge University Press:  12 March 2014

Joram Hirschfeld*
Affiliation:
Tel-Aviv University, Tel-Aviv, Israel

Extract

Since A. Robinson introduced the classes of existentially complete and generic models, conditions which were interesting for elementary classes were considered for these classes. In [6] H. Simmons showed that with the natural definitions there are prime and saturated existentially complete models and these are very similar to their elementary counterparts which were introduced by Vaught [2, 2.3]. As Example 6 will show, there is a limit to the similarity—there are theories which have exactly two existentially complete models.

In [6] H. Simmons considers the following list of properties, shows that each property implies the next one and asks whether any of them implies the previous one:

1.1. T is ℵ0-categorical.

1.2. T has an ℵ0-categorical model companion.

1.3. ∣E∣ = 1.

1.4. ∣E∣ < .

1.5. T has a countable ∃-saturated model.

1.6. T has a ∃-prime model.

1.7. Each universal formula is implied by a ∃-atomic existential formula.

[The reader is referred to [1], [3], [4] and [6] for the definitions and background.

We only mention that T is always a countable theory. All the models under discussion are countable. Thus E is the class of countable existentially complete models and F and G, respectively, are the classes of countable finite and infinite generic models. For every class C,∣C∣ is the number of (countable) models in C.]

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1978

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Barwise, J. and Robinson, A., Completing theories by forcing, Annals of Mathematical Logic, vol. 2 (1970), pp. 119142.CrossRefGoogle Scholar
[2]Chang, C.C. and Keisler, H.J., Model theory, North-Holland, Amsterdam, 1973.Google Scholar
[3]Hirschfeld, J. and Wheeler, W.H., Forcing arithmetic and division rings, Springer-Verlag, Berlin and New York, 1975.CrossRefGoogle Scholar
[4]Robinson, A., Infinite forcing in model theory, Proceeding of the Second Scandinavian Symposium, North-Holland, Amsterdam, 1971, pp. 317340.CrossRefGoogle Scholar
[5]Shelah, S., Every two elementary equivalent models have isomorphic ultrapowers, Israel Journal of Mathematics, vol. 10(1972), pp. 224233.CrossRefGoogle Scholar
[6]Simmons, H., Counting countable E.C. structures, Logique et Analyse, vol. 18(1975), pp. 307357.Google Scholar