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

Algebra Logika, 2011 Volume 50, Number 3, Pages 303–325 (Mi al488)

This article is cited in 11 papers

$o$-stable theories

B. S. Baizhanova, V. V. Verbovskiib

a Institute of Mathematics, Informatics and Mechanics, Ministry of Education and Science, Alma-Ata, Kazakhstan
b Institute for Problems of Informatics and Control Sciences, Ministry of Education and Science, Alma-Ata, Kazakhstan

Abstract: A well-developed technique created to study stable theories (M. Morley, S. Shelah) is applied in dealing with a class of theories with definable linear order. We introduce the notion of an $o$-stable theory, which generalizes the concepts of $o$-minimality, of weak $o$-minimality, and of quasi-$o$-minimality. It is proved that $o$-stable theories are dependent, but they do not exhaust the class of dependent theories with definable linear order, and that every linear order is $o$-superstable.

Keywords: $o$-stable theory, dependent theory, convex complete 1-type.

UDC: 510.67

Received: 18.03.2010


 English version:
Algebra and Logic, 2011, 50:3, 211–225

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025