RUS  ENG
Full version
JOURNALS // Algebra i logika // Archive

Algebra Logika, 2003 Volume 42, Number 2, Pages 194–210 (Mi al25)

This article is cited 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.

UDC: 510.67:512.57

Received: 04.04.2001


 English version:
Algebra and Logic, 2003, 42:2, 112–120

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024