Stable Theory

A first-order theory T is stable if for every cardinal κ (or in the classical definition for κ = |T|) the number of complete types over any parameter set of size κ is at most κ; equivalently, T does not have the order property and admits a well-behaved notion of independence (forking) used in classification theory.