##  [Morley Rank](/morley-rank-0) 

 Definition

An ordinal-valued rank assigned to a definable set in a complete first-order theory that measures its model-theoretic complexity by transfinite induction; used to classify and analyze stable theories.

 

 

 

 

 

 





## Principle

Principle

Defined by transfinite induction: RM(X) ≥ 0 iff X ≠ ∅; RM(X) ≥ α+1 iff X can be partitioned into infinitely many pairwise disjoint definable subsets each of rank ≥ α; for limit λ, RM(X) ≥ λ iff RM(X) ≥ α for all α < λ.

 

 

 

 

 





## Demonstration

Demonstration

In an algebraically closed field, Zariski-closed sets have finite Morley rank equal to their Zariski dimension: a finite set has rank 0, an irreducible curve has rank 1, and cartesian products add ranks, so Morley rank behaves like geometric dimension in this ω-stable theory.

 

 

 

 

## Misapplication

Misapplication

Applying Morley rank to arbitrary (non-definable) sets, to incomplete theories without fixing parameters, or assuming it always yields a finite ordinal in unstable theories; confusing the rank with raw cardinality or with Morley degree.

 

 

 

 

 





## Consequence

Consequence

When properly applied to definable sets in a complete theory, Morley rank yields a stratification of definable sets into well-behaved levels, detects ω-stability when all definable sets have finite rank, and supports canonical decompositions used in classification.

 

 

 

 

## Reversal

Reversal

Inverting the concept yields contemplation of sets of minimal rank (rank 0) versus sets of high or infinite rank; low Morley rank indicates rigidity and tameness, high/infinite rank indicates combinatorial complexity or instability.

 

 

 

 

 





## Boundary

Boundary

Relevant only for definable sets (or types) in first-order languages and best-behaved in complete stable theories; for many unstable or incomplete contexts the rank is infinite, undefined, or fails to reflect useful structure.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Tension exists between Morley rank as a combinatorial/transfinite invariant and geometric notions of dimension (Krull/Zariski dimension); it also competes with finer ranks (e.g., U-rank, Lascar rank) that capture forking or strong-type distinctions.

 

 

 

 

 





## Synthesis

Synthesis

Morley rank is a transfinite, inductively defined ordinal invariant for definable sets in complete first-order theories that abstracts geometric dimension into a tool for classifying stability and organizing definable structure.