In mathematical logic, Morley rank, introduced by , is a means of measuring the size of a subset of a model of a theory, generalizing the notion of dimension in algebraic geometry.
Fix a theory T with a model M. The Morley rank of a formula àdefining a definable (with parameters) subset S of M is an ordinal or −1 or âÂÂ, defined by first recursively defining what it means for a formula to have Morley rank at least ñ for some ordinal ñ.
The Morley rank is then defined to be ñ if it is at least ñ but not at least ñ + 1, and is defined to be â if it is at least ñ for all ordinals ñ, and is defined to be −1 if S is empty.
For a definable subset of a model M (defined by a formula ÃÂ) the Morley rank is defined to be the Morley rank of àin any âµ<sub>0</sub>-saturated elementary extension of M. In particular for âµ<sub>0</sub>-saturated models the Morley rank of a subset is the Morley rank of any formula defining the subset.
If àdefining S has rank ñ, and S breaks up into no more than n < àsubsets of rank ñ, then àis said to have Morley degree n. A formula defining a finite set has Morley rank 0. A formula with Morley rank 1 and Morley degree 1 is called strongly minimal. A strongly minimal structure is one where the trivial formula x = x is strongly minimal. Morley rank and strongly minimal structures are key tools in the proof of Morley's categoricity theorem and in the larger area of model theoretic stability theory.