Advertisement

Simplicity

  • Frank O. Wagner
Chapter
Part of the Mathematics and Its Applications book series (MAIA, volume 503)

Abstract

Throughout this book, we shall work inside a big, κ-saturated κ-homogeneous model C of a complete first-order theory T in a language L; we call C the monster model. Every model we consider will have cardinality less than κ and be an elementary substructure of C; every set of parameters will have cardinality less than κ and be a subset of C, and every tuple will have length less than κ and come from C. Since every model of T of cardinality less than κ can be elementarily embedded into C, this is no restriction, but it simplifies the arguments and helps the intuition, as everything takes place inside a fixed “universal domain”.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographical Remarks

  1. [20]
    Enrique Casanovas. The number of types in simple theories. Annals of Pure and Applied Logic, 98: 69–86, 1999.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [38]
    Rami Grossberg, José lovino, and Olivier Lessmann A primer on simple theories. Preprint, 1998.Google Scholar
  3. [64]
    Byunghan Kim Simple First Order Theories PhD thesis, University of Notre Dame, Notre Dame, USA, 1996.Google Scholar
  4. [66]
    Byunghan Kim. Forking in simple unstable theories. Journal of the London Mathematical Society, 57: 257–267, 1998.CrossRefGoogle Scholar
  5. [67]
    Byunghan Kim A note on Lascar strong types in simple theories. Journal of Symbolic Logic, 63: 926–936, 1998.CrossRefMathSciNetGoogle Scholar
  6. [68]
    Byunghan Kim. Simplicity, and stability in there. Preprint, 1999.Google Scholar
  7. [70]
    Byunghan Kim and Anand Pillay. Simple theories. Annals of Pure and Applied Logic, 88: 149–164, 1997.CrossRefzbMATHMathSciNetGoogle Scholar
  8. [82]
    Daniel Lascar. On the category of models of a complete theory. Journal of Symbolic Logic, 82: 249–266, 1982.CrossRefGoogle Scholar
  9. [87]
    Daniel Lascar. The group of automorphisms of a relational saturated structure. In Finite and Infinite Combinatorics in Sets and Logic (Proceedings, Banff 1991), NATO ASI Series C: Math. Phys. Sci. 411, pages 225–236. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1993.Google Scholar
  10. [147]
    Saharon Shelah. Classification Theory. North-Holland, Amsterdam, The Netherlands, 1978.Google Scholar
  11. [149]
    Saharon Shelah. Simple unstable theories. Annals of Pure and Applied Logic, 19: 177–203, 1980.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Frank O. Wagner
    • 1
  1. 1.Institut Girard DesarguesUniversité Claude Bernard (Lyon-1)VilleurbanneFrance

Personalised recommendations