z-logo
Premium
The equality S 1 = D = R
Author(s) -
Grossberg Rami,
Kolesnikov Alexei,
Tomašić Ivan,
Van Dieren Monica
Publication year - 2003
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.200310012
Subject(s) - mathematics , rank (graph theory) , combinatorics , exposition (narrative) , discrete mathematics , art , literature
The new result of this paper is that for θ ( x ; a )‐stable (a weakening of “ T is stable”) we have S 1[ θ ( x ; a )] = D [ θ ( x ; a ), L , ∞]. S 1 is Hrushovski's rank. This is an improvement of a result of Kim and Pillay, who for simple theories under the (strong) assumption that either of the ranks be finite obtained the same identity. Only the first equality is new, the second equality is a result of Shelah from the seventies. We derive it by studying localizations of several rank functions, we get the following Main Theorem. Suppose that μ is regular satisfying μ ≥ | T | + , p is a finite type, and Δ is a set of formulas closed under Boolean operations. If either (a) R [ p , Δ, μ + ] < ∞ or (b) p is Δ‐stable and μ satisfies “for every sequence { μ i : i < |Δ| + ℵ 0 } of cardinals μ i < μ we have that $ \prod _{i < \vert \Delta \vert + \aleph _{0}} \mu _{i} < \mu $ holds”, then S [ p , Δ, μ + ] = D [ p , Δ, μ + ] = R [ p , Δ, μ + ]. The S rank above is a localized version of Hrushovski's S 1 rank. This rank, as well as our systematic use of local stability, allows us to get a more conceptual proof of the equality of D and R , which is an old result of Shelah. A particular (asymptotic) case of the theorem offers a new sufficient condition for the equality of S 1 and D [·, L , ∞]. We also manage, due to a more general approach, to avoid some combinatorial difficulties present in Shelah's original exposition.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here