On countable simple unidimensional theories

Journal of Symbolic Logic 68 (4):1377-1384 (2003)
Abstract
We prove that any countable simple unidimensional theory T is supersimple, under the additional assumptions that T eliminates hyperimaginaries and that the $D_\phi-ranks$ are finite and definable
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1067620193
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,224
Through your library
References found in this work BETA
Unidimensional Theories Are Superstable.Ehud Hrushovski - 1990 - Annals of Pure and Applied Logic 50 (2):117-137.

Add more references

Citations of this work BETA
On Analyzability in the Forking Topology for Simple Theories.Ziv Shami - 2006 - Annals of Pure and Applied Logic 142 (1):115-124.

Add more citations

Similar books and articles
A Note on Lascar Strong Types in Simple Theories.Byunghan Kim - 1998 - Journal of Symbolic Logic 63 (3):926-936.
Properties and Consequences of Thorn-Independence.Alf Onshuus - 2006 - Journal of Symbolic Logic 71 (1):1 - 21.
On Atomic or Saturated Sets.Ludomir Newelski - 1996 - Journal of Symbolic Logic 61 (1):318-333.
Definability and Definable Groups in Simple Theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.
The Classification of Small Weakly Minimal Sets. II.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (2):625-635.
On Kueker Simple Theories.Ziv Shami - 2005 - Journal of Symbolic Logic 70 (1):216 - 222.
Added to PP index
2009-01-28

Total downloads
10 ( #440,607 of 2,192,001 )

Recent downloads (6 months)
1 ( #289,023 of 2,192,001 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature