Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T14:48:21.804Z Has data issue: false hasContentIssue false

From Stability to Simplicity

Published online by Cambridge University Press:  15 January 2014

Byunghan Kim
Affiliation:
Mathematical Sciences Research Institute, 1000 Centennial Drive, Berkeley, CA 94720, USA E-mail: bkim@msri.org
Anand Pillay
Affiliation:
Department of Mathematics, University of Illinois Urbana, IL 61801, USA and Mathematical Sciences Research Institute 1000 Centennial Drive Berkeley, CA 94720, USA E-mail: pillay@math.uiuc.edu

Extract

§1. Introduction. In this report we wish to describe recent work on a class of first order theories first introduced by Shelah in [32], the simple theories. Major progress was made in the first author's doctoral thesis [17]. We will give a survey of this, as well as further works by the authors and others.

The class of simple theories includes stable theories, but also many more, such as the theory of the random graph. Moreover, many of the theories of particular algebraic structures which have been studied recently (pseudofinite fields, algebraically closed fields with a generic automorphism, smoothly approximable structures) turn out to be simple. The interest is basically that a large amount of the machinery of stability theory, invented by Shelah, is valid in the broader class of simple theories. Stable theories will be defined formally in the next section. An exhaustive study of them is carried out in [33]. Without trying to read Shelah's mind, we feel comfortable in saying that the importance of stability for Shelah lay partly in the fact that an unstable theory T has 2λ many models in any cardinal λ ≥ ω1 + |T| (proved by Shelah). (Note that for λ ≥ |T| 2λ is the maximum possible number of models of cardinality λ.)

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1998

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

Article purchase

Temporarily unavailable