The equality S1 = D = R

Mathematical Logic Quarterly 49 (2):115-128 (2003)
  Copy   BIBTEX

Abstract

The new result of this paper is that for θ-stable we have S1[θ] = D[θ, L, ∞]. S1 is Hrushovski's rank. This is an improvement of a result of Kim and Pillay, who for simple theories under the 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 followingMain Theorem. Suppose that μ is regular satisfying μ ≥ |T|+, p is a finite type, and Δ is a set of formulas closed under Boolean operations. If either R[p, Δ, μ+] < ∞ or p is Δ-stable and μ satisfies “for every sequence {μi : i < |Δ| + ℵ0} of cardinals μi < μ we have that equation image holds”, then S[p, Δ, μ+] = D[p, Δ, μ+] = R[p, Δ, μ+].The S rank above is a localized version of Hrushovski's S1 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 case of the theorem offers a new sufficient condition for the equality of S1 and D[·, L, ∞]. We also manage, due to a more general approach, to avoid some combinatorial difficulties present in Shelah's original exposition

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-11-02

Downloads
32 (#473,773)

6 months
6 (#431,022)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

[Omnibus Review].Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.
Simple theories.Byunghan Kim & Anand Pillay - 1997 - Annals of Pure and Applied Logic 88 (2-3):149-164.
On strongly minimal sets.J. T. Baldwin & A. H. Lachlan - 1971 - Journal of Symbolic Logic 36 (1):79-96.
An introduction to forking.Daniel Lascar & Bruno Poizat - 1979 - Journal of Symbolic Logic 44 (3):330-350.
Fundamentals of forking.Victor Harnik & Leo Harrington - 1984 - Annals of Pure and Applied Logic 26 (3):245-286.

View all 12 references / Add more references