Reducts of Stable, CM-Trivial Theories

Journal of Symbolic Logic 70 (4):1025 - 1036 (2005)
  Copy   BIBTEX

Abstract

We show that every reduct of a stable. CM-trivial theory of finite U-rank is CM-trivial

Other Versions

No versions found

Similar books and articles

Ample dividing.David M. Evans - 2003 - Journal of Symbolic Logic 68 (4):1385-1402.
CM-Triviality and stable groups.Frank Wagner - 1998 - Journal of Symbolic Logic 63 (4):1473-1495.
The geometry of forking and groups of finite Morley rank.Anand Pillay - 1995 - Journal of Symbolic Logic 60 (4):1251-1259.
Supersimple ω-categorical groups and theories.David Evans & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (2):767-776.
Mekler's construction preserves CM-triviality.Andreas Baudisch - 2002 - Annals of Pure and Applied Logic 115 (1-3):115-173.
CM-triviality and generic structures.Ikuo Yoneda - 2003 - Archive for Mathematical Logic 42 (5):423-433.
A free pseudospace.Andreas Baudisch & Anand Pillay - 2000 - Journal of Symbolic Logic 65 (1):443-460.
On omega-categorical simple theories.Daniel Palacín - 2012 - Archive for Mathematical Logic 51 (7-8):709-717.

Analytics

Added to PP
2010-08-24

Downloads
152 (#278,155)

6 months
30 (#310,781)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the forking topology of a reduct of a simple theory.Ziv Shami - 2020 - Archive for Mathematical Logic 59 (3-4):313-324.

Add more citations

References found in this work

A new strongly minimal set.Ehud Hrushovski - 1993 - Annals of Pure and Applied Logic 62 (2):147-166.
The number of types in simple theories.Enrique Casanovas - 1999 - Annals of Pure and Applied Logic 98 (1-3):69-86.

Add more references