Elimination of Hyperimaginaries and Stable Independence in Simple CM-Trivial Theories
نویسندگان
چکیده
In a simple CM-trivial theory every hyperimaginary is interbounded with a sequence of finitary hyperimaginaries. Moreover, such a theory eliminates hyperimaginaries whenever it eliminates finitary hyperimaginaries. In a supersimple CM-trivial theory, the independence relation is stable.
منابع مشابه
Simplicity, and Stability in There
Firstly, in this paper, we prove that the equivalence of simplicity and the symmetry of forking. Secondly, we attempt to recover deenability part of stability theory to simplicity theory. In particular, using elimination of hyperimaginaries we prove that for any supersimple T , canonical base of an amalgamation class P is the union of names of-deenitions of P, ranging over stationary L-formulas...
متن کاملAnother Look at Stable Forking in 1-based Supersimple Theories
We give two alternative proofs that 1-based theories of finite SU-rank have stable forking, neither of which seems to require the full power of elimination of hyperimaginaries. We also show some miscellaneous results related to stable forking in simple theories.
متن کاملQualifying Exam Syllabus
Basic constructions: The completeness and compactness theorems. The Löwenheim-Skolem theorem. Omitting types. Ultraproducts. Indiscernible sequences. Nice properties: Saturation, homogeneity, and the monster model. Elimination of imaginaries and Meq. Quantifier elimination. Model completeness. Countably categorical theories. Stable theories: Characterizations of a stable formula. Stable, supers...
متن کاملCompactness and independence in non first order frameworks
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory deals transparently with hyperimaginaries, and accommodates various analytic structures which defy direct first order treatment. We describe the development of simplicity theory in this setting, and an application to ...
متن کاملOn the n-uniqueness of types in rosy theories
We prove that in a rosy theory, the n-uniqueness of a strong type p implies the strong n-uniqueness of p. In addition we study some of the boundary properties of p. In [5], given a strong type p = tp(c/A) in a stable theory T , if T has (≤ n)-uniqueness while p does not have (n + 1)-uniqueness then, over an infinite Morley sequence of the type of some finite tuple c′ ∈ acl(cA) over A witnessing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 54 شماره
صفحات -
تاریخ انتشار 2013