U-rank

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.

Definition

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 , where p is really p(x), and x is a tuple of variables of length n. This subscript is typically omitted when no confusion can result.

Ranking theories

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, .

We then get a concise characterization of superstability; a stable theory T is superstable if and only if for every n.

Properties

Examples

References

Pillay, Anand (2008) [1983]. An Introduction to Stability Theory. Dover. p. 57. ISBN 978-0-486-46896-9. 

    This article is issued from Wikipedia - version of the 10/8/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.