Reducts of stable, CM-trivial theories
نویسنده
چکیده
We show that every reduct of a stable, CM-trivial theory of finite Lascar rank is CM-trivial. AMS classification: 03C45
منابع مشابه
Trivial Stable Structures with Non-trivial Reducts
We offer a new viewpoint on some of the generic structures constructed using Hrushovski’s predimensions and show that they are natural reducts of quite straightforward trivial, one-based stable structures. 2000 Mathematics Subject Classification: 03C45.
متن کامل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.
متن کاملWeakly one-based geometric theories
We study the class of weakly locally modular geometric theories introduced in [5], a common generalization of the classes of linear SU-rank 1 and linear o-minimal theories. We nd new conditions equivalent to weak local modularity: weak one-basedness and the absence of type de nable almost quasidesigns. Among other things, we show that weak one-basedness is closed under reducts and generic predi...
متن کاملReducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (constraints), the stable-model semantics, in its broadly accepted generalization stemming from the work by Pearce, Ferraris and Lifschitz, has a competitor: the semantics proposed by Faber, Leone and Pfeifer, which se...
متن کاملReducts of propositional theories, satisfiability relations, and generalizations of semantics of logic
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (constraints), the stable-model semantics, in its broadly accepted generalization stemming from the work by Pearce, Ferraris and Lifschitz, has a competitor: the semantics proposed by Faber, Leone and Pfeifer, which se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 70 شماره
صفحات -
تاریخ انتشار 2005