Morley Rank¶
Morley rank measures recursive infinite definable splitting of a set in a first-order structure.
Core Idea¶
Morley rank measures how many ordinal levels of infinite splitting into definable subsets a definable set supports. Nonempty finite definable sets have rank zero; the successor test requires infinitely many pairwise disjoint subcases of prior rank, possibly over an elementary extension.[^ref-e8e486bceb4a]
Scope of Application¶
The invariant is used in model theory. In an infinite algebraically closed field K, each parameter-defined point has rank 0, so infinitely many points give MR(K) ≥ 1. Quantifier elimination makes every definable subset of K finite or cofinite; no two rank-at-least-one cofinite subsets can be disjoint, so MR(K)=1. This agrees with the line's algebraic dimension in this setting.[^ref-050be669abfb]
Clarity¶
It is not set size, matrix rank, or Morley degree. Definability and infinite—not merely finite—splitting matter. Rank and degree are distinct invariants, not two sides of a performance tradeoff.
Manages Complexity¶
An ordinal condenses the depth of a definable-set hierarchy while degree separately tracks maximal-rank multiplicity.
Abstract Reasoning¶
Check nonemptiness, then seek infinitely many incompatible definable lower-rank pieces for each successor step. At a limit, check every earlier bound.[^ref-e8e486bceb4a]
Knowledge Transfer¶
The recursion travels across first-order theories; algebraic dimension is only a special comparison, not the definition everywhere.
[^ref-e8e486bceb4a]: Scanlon, Morley Rank tutorial. [^ref-050be669abfb]: Deloro, Basic Model Theory of Algebraically Closed Fields, §4.2, Definition 4.6 and Example 4.8, pp. 17–18.
Neighborhood in Abstraction Space¶
Morley Rank sits in a sparse region of the domain-specific corpus (84th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Abstract Algebra & Category Theory (24 abstractions)
Nearest neighbors
- Cumulative Hierarchy — 0.83
- Successor Ordinal — 0.83
- Slow-Growing Hierarchy — 0.81
- Supertransitive class — 0.81
- Set Cover Problem — 0.81
Computed from structural-signature embeddings · 2026-10-08