A model theorist proves that a formula φ(x, y) in a complete theory T defines an infinite linear ordering on a definable set — that is, T has the order property. What does this immediately imply about T?
AT is stable, because linear orders are well-understood and algebraically tractable structures
BT is unstable, because the order property implies the number of types over a set of size λ can be as large as 2^λ, violating the stability bound
CT is ω-categorical, because a single linear ordering of the natural numbers has a unique countable model
DT is complete and has quantifier elimination, because definable linear orders give complete control over the type space
The order property is Shelah's key diagnostic: a theory has the order property iff it is unstable. Intuitively, a definable linear order allows types to encode Dedekind-cut-like distinctions — for a set A of size λ, you can construct 2^λ many different types over A (one for each cut in the ordering). This exponential blowup violates the stability condition |S(A)| ≤ |A|. The theory of dense linear orders (ℚ, <) is the canonical example of an unstable theory for exactly this reason. Stability requires that no such linear ordering be definable in the theory.
Question 2 Multiple Choice
Why is stability a valuable property for a theory to have from the perspective of model-theoretic analysis?
AStable theories have exactly one model in each infinite cardinality, making classification trivial
BStable theories guarantee that saturated models exist in every uncountable cardinality, giving precise structural control over models at all sizes
CStable theories are decidable, meaning there is an algorithm to determine the truth of any sentence in the theory
DStability implies that every definable set is either finite or cofinite, simplifying the combinatorics of the theory
The central payoff of stability is the existence of saturated models in every uncountable cardinality: a saturated model of size κ realizes all types over subsets of size less than κ. This means you can always find elements realizing any consistent type, giving enormous flexibility for analyzing and comparing models. In unstable theories, saturated models may fail to exist in many cardinalities. Option 0 is wrong — Morley's categoricity gives one model in uncountable cardinalities for ω-categorical theories, not all stable theories. Option 3 describes strong minimality, the strongest form of stability, not stability in general.
Question 3 True / False
The theory ACF of algebraically closed fields is stable because every definable subset of a model is either finite or cofinite — a property called strong minimality.
TTrue
FFalse
Answer: True
ACF is the standard example of a strongly minimal theory, which is the bottom rung of the stability hierarchy. In ACF, every definable set is either finite or cofinite (by quantifier elimination, definable sets over an algebraically closed field are Boolean combinations of zero sets of polynomials, which are always finite unless the polynomial is identically zero). Strong minimality implies ω-stability, which implies superstability, which implies stability — ACF is stable by the most stringent criterion. This makes algebraically closed fields one of the most amenable structures in model theory.
Question 4 True / False
An unstable theory has no interesting model-theoretic structure and can seldom be studied systematically using the tools of classification theory.
TTrue
FFalse
Answer: False
Instability does not preclude deep model-theoretic analysis — it just means Shelah's stability-theoretic toolkit does not directly apply. Many unstable theories have rich, systematic structure: the theory of dense linear orders (unstable but well-studied), the theory of the random graph (a simple theory that generalizes stability by relaxing forking symmetry), and o-minimal theories (which extend ideas from stability to ordered structures) all belong to the broader landscape of classification theory. Shelah's program classifies theories by their complexity — unstable theories fall into their own subcategories (NIP, simple, NSOP, etc.) each with its own tools.
Question 5 Short Answer
State what it means for a theory to have the 'order property,' and explain why possessing the order property is incompatible with stability.
Think about your answer, then reveal below.
Model answer: A theory T has the order property if there exists a formula φ(x, y) and an infinite sequence of elements (a_i) in a model such that φ(a_i, a_j) holds iff i < j — meaning φ defines a linear ordering on a definable set. This is incompatible with stability because a definable linear order allows constructing exponentially many types: for any set A, you can define 2^|A| types corresponding to different Dedekind cuts in the order. The stability condition requires |S(A)| ≤ |A| for all large A, so the exponential type count produced by the order property directly violates stability.
The intuition is that linear orders encode unbounded combinatorial complexity: given n elements in a linear order, they can be arranged in n! ways, and every Dedekind cut produces a new type. Stability, by contrast, demands that types over a set are few — at most as many as the set itself. The order property is not just an inconvenient feature; it is the exact diagnostic for when type spaces become uncontrollably large. Shelah's insight was that the absence of the order property is precisely the structural regularity that makes deep model-theoretic classification possible.