Skip to main content

Simplicity

  • Chapter
Simple Theories

Part of the book series: Mathematics and Its Applications ((MAIA,volume 503))

  • 178 Accesses

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”.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographical Remarks

  1. Enrique Casanovas. The number of types in simple theories. Annals of Pure and Applied Logic, 98: 69–86, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  2. Rami Grossberg, José lovino, and Olivier Lessmann A primer on simple theories. Preprint, 1998.

    Google Scholar 

  3. Byunghan Kim Simple First Order Theories PhD thesis, University of Notre Dame, Notre Dame, USA, 1996.

    Google Scholar 

  4. Byunghan Kim. Forking in simple unstable theories. Journal of the London Mathematical Society, 57: 257–267, 1998.

    Article  Google Scholar 

  5. Byunghan Kim A note on Lascar strong types in simple theories. Journal of Symbolic Logic, 63: 926–936, 1998.

    Article  MathSciNet  Google Scholar 

  6. Byunghan Kim. Simplicity, and stability in there. Preprint, 1999.

    Google Scholar 

  7. Byunghan Kim and Anand Pillay. Simple theories. Annals of Pure and Applied Logic, 88: 149–164, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  8. Daniel Lascar. On the category of models of a complete theory. Journal of Symbolic Logic, 82: 249–266, 1982.

    Article  Google Scholar 

  9. 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. Saharon Shelah. Classification Theory. North-Holland, Amsterdam, The Netherlands, 1978.

    Google Scholar 

  11. Saharon Shelah. Simple unstable theories. Annals of Pure and Applied Logic, 19: 177–203, 1980.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Wagner, F.O. (2000). Simplicity. In: Simple Theories. Mathematics and Its Applications, vol 503. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-3002-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-3002-0_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5417-3

  • Online ISBN: 978-94-017-3002-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics