Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-31T19:46:38.040Z Has data issue: false hasContentIssue false
  • English
  • Français

The spectrum of resplendency

Published online by Cambridge University Press:  12 March 2014

John T. Baldwin
John T. Baldwin*
Affiliation:
Department of Mathematics, Statistics and Computer Science, University of Illinoisat Chicago, Chicago, Illinois 60680
Get access Rights & Permissions [Opens in a new window]

Abstract

Let T be a complete countable first order theory and λ an uncountable cardinal. Theorem 1. If T is not superstable, T has 2λ resplendent models of power λ. Theorem 2. If T is strictly superstable, then T has at least min(2λ, ℶ2) resplendent models of power λ. Theorem 3. If T is not superstable or is small and strictly superstable, then every resplendent homogeneous model of T is saturated. Theorem 4 (with Knight). For each μ ∈ ω ∪ {ω, 2ω} there is a recursive theory in a finite language which has μ resplendent models of power κ for every infinite κ.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 55 , Issue 2 , June 1990 , pp. 626 - 636
Copyright
Copyright © Association for Symbolic Logic 1990

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]Baldwin, J. T., Diverse classes, this Journal, vol. 54 (1989), pp. 875–893.Google Scholar
[2]Baldwin, J. T., Fundamentals of stability theory, Springer-Verlag, Berlin, 1988.CrossRefGoogle Scholar
[3]Barwise, J. and Schlipf, J., An introduction to recursively saturated and resplendent models, this Journal, vol. 41 (1976), pp. 531–536.Google Scholar
[4]Buechler, S., Recursive definability and resplendency in ω-stable theories, Israel Journal of Mathematics, vol. 49 (1984), pp. 26–34.CrossRefGoogle Scholar
[5]Hart, B., An exposition of otop, Classification theory: Chicago, 1985, Lecture Notes in Mathematics, vol. 1292, Springer-Verlag, Berlin, 1987, pp. 107–126.CrossRefGoogle Scholar
[6]Knight, J. F., Saturation of homogeneous resplendent models, this Journal, vol. 51 (1986), pp. 222–224.Google Scholar
[7]Knight, J. F., Theories whose resplendent, models are homogeneous, Israel Journal of Mathematics, vol. 42 (1982), pp. 151–161.CrossRefGoogle Scholar
[8]Knight, J. F. and Nadel, M., Expansions of models and Turing degrees, this Journal, vol. 47 (1982), pp. 587–604.Google Scholar
[9]Poizat, B., Cours de théorie des modèles, Nur al-Mantiq wal-Ma'rifah, Villeurbanne, 1985.Google Scholar
[10]Poizat, B., Malaise et guérison, Logic Colloquium '84 (Paris, J. B.et al., editors), North-Holland, Amsterdam, 1986, pp. 155–163.CrossRefGoogle Scholar
[11]Saffe, J., One theorem on the number of uncountable models, Preprint No. 31-83, Institute of Mathematics, Siberian Division, Academy of Sciences of the USSR, Novosibirsk, 1983.Google Scholar
[12]Shelah, S., Classification theory and the number of non-isomorphic models, North-Holland, Amsterdam, 1978.Google Scholar
[13]Shelah, S., Finite diagrams stable in power, Annals of Mathematical Logic, vol. 2(1970), pp. 69–118.CrossRefGoogle Scholar
[14]Shelah, S., On the number of strongly ℵε-saturated models of power λ, Annals of Pure and Applied Logic, vol. 36 (1987), pp. 279–288.CrossRefGoogle Scholar
[15]Shelah, S., Universal classes, Part 1, Classification theory: Chicago, 1985, Lecture Notes in Mathematics, vol. 1292, Springer-Verlag, Berlin, 1987, pp. 265–419.Google Scholar