In model theory, a branch of mathematical logic, U-rank is one measure of the complexity of a (complete) type, in the context of stable theories. As usual, higher U-rank indicates less restriction, and the existence of a U-rank for all types over all sets is equivalent to an important model-theoretic condition: in this case, superstability.
U-rank is defined inductively, as follows, for any (complete) n-type p over any set A:
We say that U(p) = α when the U(p) ≥ α but not U(p) ≥ α + 1.
If U(p) ≥ α for all ordinals α, we say the U-rank is unbounded, or U(p) = ∞.
Note: U-rank is formally denoted
Un(p)
U-rank is monotone in its domain. That is, suppose p is a complete type over A and B is a subset of A. Then for q the restriction of p to B, U(q) ≥ U(p).
If we take B (above) to be empty, then we get the following: if there is an n-type p, over some set of parameters, with rank at least α, then there is a type over the empty set of rank at least α. Thus, we can define, for a complete (stable) theory T,
Un(T)=\sup\{Un(p):p\inS(T)\}
We then get a concise characterization of superstability; a stable theory T is superstable if and only if
Un(T)<infty
U1(T)=1
Book: Pillay . Anand . An Introduction to Stability Theory . 2008 . 1983 . Dover . 978-0-486-46896-9 . 57.