Skip to main content
SpringerLink
Log in

Ranks and definability in superstable theories

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

We study the notion of definable type, and use it to define theproduct of types and theheir of a type. Then, in the case of stable and superstable theories, we make a general study of the notion of rank. Finally, we use these techniques to give a new proof of a theorem of Lachlan on the number of isomorphism types of countable models of a superstable theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. T. Baldwin,Countable theories categorical in some uncountable power, Ph. D. Thesis, Simon Fraser University, 1971.

  2. J. T. Baldwin and A. H. Lachlan,On strongly minimal sets, J. Symbolic Logic36 (1971), 79–96.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Berthier,Stability of non model complete theories, product, groups, Centre Mathématique de l'École Polytechnique, Paris, 1973 (preprint).

    Google Scholar 

  4. D. Booth,Ultrafilters on a countable set, Ann. Math. Logic2 (1970), 1–24.

    Article  MATH  MathSciNet  Google Scholar 

  5. C. C. Chang and H. J. Keisler,Model Theory, North Holland, Amsterdam, 1973.

    MATH  Google Scholar 

  6. M. Dickmann, The problem of non finite axiomatic stability ofℵ 1 -categorical theories, The Proceedings of the Bertrand Rusell Memorial Logic Conference, 1971.

  7. F. Hausdorff,Set Theory, Chelsea Publishing Co., 1962.

  8. A. H. Lachlan,On the number of countable models of a countable superstable theory, Fund. Math.81 (1974), 133–145.

    MATH  MathSciNet  Google Scholar 

  9. D. Lascar,Types definissables et produit de types, C.R.A.S. Paris,276 (1973), 1253–1256.

    MATH  MathSciNet  Google Scholar 

  10. P. Lindström,Remarks on some theorems of Keisler, J. Symbolic Logic33 (1968) 571–576.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. Łos,On the categoricity in power of elementary deductive systems, Colloq. Math.3 (1954), 58–62.

    Google Scholar 

  12. M. D. Morley,Categoricity in power, Trans. Amer. Math. Soc.114 (1965), 514–538.

    Article  MATH  MathSciNet  Google Scholar 

  13. M. D. Morley, Countable models ofℵ 1 -categorical theories, Israel J. Math.5 (1967), 65–72.

    MATH  MathSciNet  Google Scholar 

  14. G. E. Sacks,Saturated Model Theory, Benjamin, Reading, Mass., 1972.

    MATH  Google Scholar 

  15. S. Shelah,Stable theories, Israel J. Math.7 (1969), 187–202.

    MATH  MathSciNet  Google Scholar 

  16. S. Shelah,Stability and the f.c.p.; model-theoretic properties of formulas in first-order theories, Ann. Math. Logic3 (1971), 271–362.

    Article  MATH  MathSciNet  Google Scholar 

  17. S. Shelah, Manuscript ofStable Theories.

  18. W. Sierpinski,Cardinal and Ordinal Numbers, Polish Scientific Publisher, Warsawa, 1965.

    MATH  Google Scholar 

  19. W. Szmielew,Elementary properties of Abelian groups, Fund. Math.41 (1955), 203–271.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. U. E. R. de Mathématiques, C. N. R. S. Université de Paris, 7 Place Jussieu, 75005, Paris, France

    Daniel Lascar

Authors
  1. Daniel Lascar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lascar, D. Ranks and definability in superstable theories. Israel J. Math. 23, 53–87 (1976). https://doi.org/10.1007/BF02757234

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02757234

Keywords

Search

Navigation