|
This article is cited in 20 scientific papers (total in 20 papers)
$E^*$-Stable Theories
E. A. Palyutin Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
S. Shelah proved that stability of a theory is equivalent to definability of every complete type of that theory. T. Mustafin introduced the concept of being $T^*$-stable, generalizing the notion of being stable. However, $T^*$-stability does not necessitate definability of types. The key result of the present article is proving the definability of types for $E^*$-stable theories. This concept differs from that of being $T^*$-stable by adding the condition of being continuous. As a consequence we arrive at the definability of types over any $P$-sets in $P$-stable theories, which previously was established by T. Nurmagambetov and B. Poizat for types over $P$-models.
Keywords:
$E^*$-stable theory, definability of types.
Received: 04.04.2001
Citation:
E. A. Palyutin, “$E^*$-Stable Theories”, Algebra Logika, 42:2 (2003), 194–210; Algebra and Logic, 42:2 (2003), 112–120
Linking options:
https://www.mathnet.ru/eng/al25 https://www.mathnet.ru/eng/al/v42/i2/p194
|
Statistics & downloads: |
Abstract page: | 388 | Full-text PDF : | 122 | References: | 64 | First page: | 1 |
|