Next Article in Journal
On ps-Supplement Submodules
Previous Article in Journal
Wearable Activity Monitors to Quantify Gait During Stroke Rehabilitation: Data from a Pilot Randomised Controlled Trial Examining Auditory Rhythmical Cueing
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On One Laura Mayer’s Theorem

by
Bektur Baizhanov
1,2,3,
Nargiza Tazabekova
1,2,3,* and
Tatyana Zambarnaya
1
1
Institute of Mathematics and Mathematical Modeling, Almaty 050010, Kazakhstan
2
School of Applied Mathematics, Kazakh-British Technical University, Almaty 050000, Kazakhstan
3
Faculty of Engineering and Natural Sciences, Department of Mathematics, SDU University, Kaskelen 040900, Kazakhstan
*
Author to whom correspondence should be addressed.
Symmetry 2025, 17(10), 1641; https://doi.org/10.3390/sym17101641
Submission received: 27 August 2025 / Revised: 22 September 2025 / Accepted: 23 September 2025 / Published: 3 October 2025
(This article belongs to the Section Mathematics)

Abstract

The article’s primary focus is on the study of the number of countable non-isomorphic models of linearly ordered theories. The orthogonality of 1-types and their convex closures is employed to analyse a class of theories with a specific type of monotonic non-orthogonality, which includes weakly o-minimal theories. For such theories, a theorem analogous to L. Mayer’s result on the independence of any pairwise independent family of 1-types in o-minimal theories is proven. The article provides conditions for the infinity and maximality of the countable spectrum of weakly o-minimal theories.

1. Introduction

Definition 1
([1]). A linearly ordered structure M = M ; < , is o-minimal if all of its subsets definable with parameters are finite unions of points and open intervals. A theory is o-minimal if all its models are o-minimal.
When proving Vaught’s conjecture for o-minimal theories, L. Mayer confirmed the following theorem.
Theorem 1
([2]). Let T be an o-minimal theory such that T has fewer than 2 0 countable models. Let Γ be a pairwise independent set of nonisolated elements of S 1 ( ) . Then Γ is independent.
L. Mayer’s work is based on the theory of non-weak orthogonality which was developed for o-minimal theories by D. Marker [3]. In this article, we use ideas from the proof of L. Mayer’s theorem to give its generalization for small theories with monotonic non-orthogonality (Theorem 4). While in o-minimal theories the proof relies on independence of 1-types, we use orthogonality of convex closures of 1-types.
According to S. Shelah, two complete types are weakly orthogonal, if their union is a complete type [4]. The following is an equivalent definition of weak orthogonality of complete 1-types.
Let A M , p , q S 1 ( A ) , and M be an | A | + -saturated structure of a language L .
Definition 2.
The type p is not weakly orthogonal to the type q, p   q       w   , if there exist an A-definable formula H ( x , y ) , α p ( M ) , and realizations β 1 , β 2 q ( M ) such that β 1 H ( M , α ) and β 2 H ( M , α ) .
The rations of weak and almost orthogonality of 1-types are equivalence relations in weakly o-minimal theories, in particular, they are symmetric.
Definition 3
([5]). A linearly ordered structure is weakly o-minimal if all of its parametrically definable subsets are finite unions of convex sets. A theory is weakly o-minimal if all its models are weakly o-minimal.
Vaught’s conjecture was confirmed for the class of quite o-minimal theories [6], for the class of weakly o-minimal theories of convexity rank 1 [7], and later, in [8], for weakly o-minimal theories of finite convexity rank. During the proofs, analogues of Theorem 1 were proved for (weakly) orthogonal families of types in the three aforementioned classes of theories.
In o-minimal and weakly o-minimal theories, each complete 1-type has a convex set of all realizations. In [9], the concepts of convex weak and convex almost orthogonality of convex 1-types in linearly ordered theories were introduced as generalizations of weak and almost orthogonality of 1-types in weakly o-minimal theories. The relation of non-weak convex orthogonality is an equivalence relation in theories with monotonic non-orthogonality on equivalence classes (Corollary 2).
Theorem 4 implies that if in a theory with monotonic non-orthogonality on equivalence classes there exists an infinite family of pairwise weakly convex orthogonal convex types, then the theory has the maximal number of countable models (Corollary 4).
Weakly o-minimal theories have monotonicity [10] and strong monotonicity [11]. The last is used to confirm that weakly o-minimal theories have monotonic non-orthogonality on equivalence classes (Proposition 3). Thereby, Theorem 4 guarantees the mentioned result for weakly o-minimal theories of an arbitrary convexity rank (Corollary 5).
In a 1996 preprint, B. Baizhanov introduced the notions of a convex to the right (left) formula, a quasisolitary and a social type. These notions were later included in the works [12,13], which are partially based on this preprint. Theorem 8 and Corollary 7 establish the connection between these notions and the weak and almost orthogonality of 1-types in weakly o-minimal theories.
In Ref. [14] an example of a weakly o-minimal theory with countable number of countable non-isomorphic models was given. Theorem 9 provides a condition under which a weakly o-minimal theory has an infinite number of countable models.

2. Preliminaries

Let M = M ; = , < , be a linearly ordered structure. Although most of the results hold for the general case, we assume the structure M is densely ordered [15,16].
For subsets A and B of M, we use the following notations:
A + : = { γ M M a < γ   for   all a A } ;
A : = { γ M M γ < a   for   all a A } .
We write A < B if for all a A , b B , M a < b . We write a < B ( A < b ) if { a } < B ( A < { b } ). If sets A and B are C-definable ( C M ), then A + , A and A < B are C-definable as well.
Definition 4.
A subset A of a linearly ordered structure M is said to be convex if a < c < b implies c A for all a , b A and all c M .
Definition 5.
A formula φ ( x , y ¯ , a ¯ ) is a convex formula, if for every b ¯ M the set φ ( M , b ¯ , a ¯ ) is convex in every model of T h ( M ) containing b ¯ and a ¯ .
In general, if a formula φ ( y 1 , y 2 , , y n , a ¯ ) defines a convex set when any assignment is given to all the variables but y i , we say that φ ( y 1 , y 2 , , y n , a ¯ ) is convex in y i .
Definition 6
([17]). (1) The convex closure of a formula φ ( x , a ¯ ) is the following formula:
φ c ( x , a ¯ ) : = y 1 y 2 φ ( y 1 , a ¯ ) φ ( y 2 , a ¯ ) ( y 1 x y 2 ) .
(2) The convex closure of a type p ( x ) S 1 ( A ) is the following type:
p c ( x ) : = { φ c ( x , a ¯ ) φ ( x , a ¯ ) p } .
Similarly, denote t p c ( α / A ) : = { φ c ( x , a ¯ ) φ ( x , a ¯ ) t p ( α / A ) } . We define S p c ( A ) : = { q S 1 ( A ) q c = p c } , and S c ( A ) : = { p c | p S 1 ( A ) } . Note that the type p c is not complete, and has a unique completion to a type from S 1 ( A ) if and only if | S p c ( A ) | = 1 . We call the type p c a convex type.
In o-minimal, weakly o-minimal, and quite o-minimal theories, the set of all realizations of any complete 1-type p is convex, that is, | S p c ( A ) | = 1 , or, equivalently, p ( M ) = p c ( M ) .
Each convex type is of one of the following kinds.
Definition 7.
Let T be a linearly ordered theory, and p c S c ( A ) be a convex 1-type, where A is a subset of an | A | + -saturated model M T .
(1) The type p c is isolated if there exists a convex formula φ ( x , a ¯ ) , a ¯ A , such that p c ( M ) = φ ( M , a ¯ ) .
(2) The type p c is quasirational to the right (left) if there exists a convex formula U ( x , a ¯ ) , a A , such that for each α p ( M ) and each β α ( β α )
β p c ( M ) if and only if β U ( M , α ) .
(3) The type p c is irrational if it is neither isolated nor quasirational.
Definition 8
([9]). Let p c , q c S c ( A ) . We say that p c is not weakly convex-orthogonal to q c , p c   q c       c w   , if there exists a convex formula H ( x , y , a ¯ ) , a ¯ A , such that H ( M , α , a ¯ ) q c ( M ) and ¬ H ( M , α , a ¯ ) q c ( M ) for all (equivalently, for some) α p c ( M ) .
Definition 9.
Let 1 n < ω , Γ = { p 1 c , p 2 c , , p n c } S c ( A ) . We say that the family Γ is not weakly convex orthogonal if there is an A-formula H ( y ¯ ) ( ln ( y ¯ ) = n ) such that there exists 1 i n such that H ( y ¯ ) is convex in y i and for some α 1 p 1 c ( M ) , α 2 p 2 c ( M ) , , α i 1 p i 1 c ( M ) , p i + 1 c ( M ) , , α n p n c ( M ) ,
H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) p i c ( M ) and ¬ H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) p i c ( M ) .
Then, the family Γ is weakly convex orthogonal if and only if for each 1 i n and each α ¯ i = ( α 1 , , α i 1 , α i + 1 , α n ) , where α j p j c ( M ) for all j i ,
t p c ( α i / α ¯ i ) = t p c ( α i / α ¯ i ) for all α i , α i p i c ( M ) .
Definition 10.
Let A , B M , H ( x , y ) be an A-formula, and E ( x , y ) be an (parametrically definable) equivalence relation with convex classes.
(1) The formula H ( x , y ) monotonically increases (decreases) on B, if for all b 1 , b 2 B , with b 1 < b 2 , the following holds:
H ( M , b 1 ) H ( M , b 2 )   a n d   H ( M , b 2 ) + H ( M , b 1 ) +
( H ( M , b 2 ) H ( M , b 1 )   a n d   H ( M , b 1 ) + H ( M , b 2 ) + ) ,
and for some distinct b 3 , b 4 B , H ( M , b 3 ) H ( M , b 4 ) .
(2) The formula H ( x , y ) monotonically increases (decreases) on B / E , if for all b 1 , b 2 B , with b 1 < b 2 and M ¬ E ( b 1 , b 2 ) , the following holds:
H ( M , b 1 ) H ( M , b 2 )   a n d   H ( M , b 2 ) + H ( M , b 1 ) +
( H ( M , b 2 ) H ( M , b 1 )   a n d   H ( M , b 1 ) + H ( M , b 2 ) + ) ,
and for some distinct b 3 , b 4 B , M ¬ E ( b 3 , b 4 ) and H ( M , b 3 ) H ( M , b 4 ) .
Let H ( y 1 , y 2 , , y n ) be an A-formula, i , j n be arbitrary and distinct, and b ¯ M be an ( n 2 ) -tuple. Then, we let H i , j b ¯ ( y j , y i ) be the result of the substitution of b ¯ for all the parameters of H but y i and y j . More precisely, if, without loss of generality, i < j , and b ¯ = ( b 1 , b 2 , , b i 1 , b i + 1 , , b j 1 , b j + 1 , , b n ) , then define
H i , j b ¯ ( x j , x i ) : = H ( b 1 , , b i 1 , y i , b i + 1 , , b j 1 , y j , b j + 1 , , b n ) .
Then, H i , j b ¯ ( x j , x i ) is an ( A b ¯ ) -definable 2-formula.
Definition 11.
(1) An A-formula H ( y 1 , y 2 , , y n ) monotonically increases (decreases) in y j with respect to y i ( 1 i j n ) on B 1 , , B j 1 , B j + 1 , , B n M , if the formula H i , j b ¯ ( x j , x i ) monotonically increases (decreases) on B i for all assignments b ¯ = ( b k ) k i , j , b k B k , k { 1 , , n } { i , j } .
(2) An A-formula H ( x , y 1 , y 2 , , y n ) monotonically increases (decreases) on equivalence classes in y j with respect to y i ( 1 i j n ) on B 1 , , B j 1 , B j + 1 , , B n M , if the formula H i , j b ¯ ( x j , x i ) monotonically increases (decreases) on B i / E i ( x , y , b ¯ ) for some equivalence relation E i ( x , y , z ¯ ) and all assignments b ¯ = ( b k ) k i , j , b k B k , k { 1 , , n } { i , j } .
We say that a formula is monotonic, if it either monotonically increases or monotonically decreases.
Definition 12.
Let T be a linearly ordered theory.
(1) The theory T has monotonic non-orthogonality if for each n < ω and each non-weakly convex orthogonal family Γ = { p 1 c , p 2 c , , p n c } S c ( A ) of non-isolated convex types such that each proper subset Γ Γ is weakly convex orthogonal, where A M is finite, and M T is | A | + -saturated, there exists an A-definable formula H ( y 1 , y 2 , , y n ) as in Definition 9 such that H ( y 1 , y 2 , , y n ) is convex in y j and strictly monotonic in y j with respect to y i on p 1 c ( M ) , p 2 c ( M ) , , p j 1 c ( M ) , p j + 1 c ( M ) , , p n c ( M ) for each distinct 1 i , j n .
(2) The theory T has monotonic non-orthogonality on equivalence classes if for each n < ω and each finite non-weakly convex orthogonal family Γ = { p 1 c , p 2 c , , p n c } S c ( A ) of non-isolated convex types such that each proper subset Γ Γ is weakly convex orthogonal, where A M is finite, and M T is | A | + -saturated, there exists an A-definable formula H ( y 1 , y 2 , , y n ) as in Definition 9 such that it is convex in y j and is strictly monotonic on equivalence classes in y j with respect to y i on p 1 c ( M ) , p 2 c ( M ) , , p j 1 c ( M ) , p j + 1 c ( M ) , , p n c ( M ) for each i , j with 1 i j n .
Each theory with monotonic non-orthogonality has monotonic non-orthogonality on equivalence classes by the trivial equivalence relation x = y . On the other hand, a theory with monotonic non-orthogonality on equivalence classes does not necessarily have monotonic non-orthogonality. But such theories retain some properties of theories with monotonic non-orthogonality by considering corresponding equivalence classes instead of the elements themselves. More precisely, if T has monotonic non-orthogonality on equivalence classes and p c , q c and H are as in Definition 8, and H monotonically increases (decreases) on p c ( M ) / E , denote H E ( x , y ) : = z E ( z , y ) H ( x , z ) . Then, the formula H E i is constant on each E ( M , β ) , β p c ( M ) , and monotonically increases (decreases) on p c ( M ) . Analogically, the formula H E i ( y 1 , , y n ) : = z i E i ( z i , y i ) H ( y 1 , , y i 1 , z i , y i + 1 , , y n ) can be taken for a formula H from Definition 9 which is monotonic on equivalence classes in y j with respect to y i on p 1 c ( M ) , p 2 c ( M ) , , p j 1 c ( M ) , p j + 1 c ( M ) , , p n c ( M ) , where E i is the corresponding equivalence relation.
Therefore, below, without loss of generality, it is enough to give proofs for theories with monotonic non-orthogonality rather than those with monotonic non-orthogonality on equivalence classes.
Example 1.
Let M = Q + ( Q + 2 ) ; = , < , P , U , a i , b i , i < ω , where < is the standard dense linear order without endpoints, P is a unary predicate and U is a binary predicate. Let a i 1 < a i 2 < b j 2 < b j 1 for all natural i 1 < i 2 , j 1 < j 2 , lim i a i = lim j b j = e , and { a i , b i } i < ω Q = P ( M ) < ¬ P ( M ) = ( Q + 2 ) . Define M U ( a , b ) if and only if M P ( a ) P ( b ) and R a < b .
Define p ( x ) : = { a i < x < b j | i , j ω } , and q ( y ) : = { U ( a i , y ) ¬ U ( b j , y ) | i , j ω } . The types p and q are convex, and are the only two distinct non-isolated types over the empty set, and p   q       w   . There are no other distinct non-isolated types over finite sets. Then, the formula U ( x , y ) monotonically increases on p ( N ) for each N M o d ( M ) . Therefore, T h ( M ) has monotonic non-orthogonality.
Example 2.
Let C = { c i } i < ω R Q be such that for each i < ω   c i a c l ( ( C { c i } ) { 2 , e } ) . For each i < ω denote Q i : = Q + c i .
Let M = M ; = , < , P i , S , U , a i , b i i < ω , where M = Q i < ω Q i + Q 2 × Q , P i and S are unary predicates and U is a binary predicate. Let S ( M ) = Q 2 × Q , ¬ S ( M ) = Q i < ω Q i , ¬ S ( M ) < S ( M ) , P ( M ) = Q ¬ S ( M ) , and P i ( M ) = Q i ¬ S ( M ) . Let < be the standard relation of linear order on ¬ S ( M ) , and the lexicographic order on S ( M ) . That is, for each r 1 , r 2 Q 2 , q 1 , q 2 Q , let ( r 1 , q 1 ) < ( r 2 , q 2 ) if and only if on R either r 1 < r 2 , or r 1 = r 2 and q 1 < q 2 .
Analogically to the previous example, let a i 1 < a i 2 < b j 2 < b j 1 for all natural i 1 < i 2 , j 1 < j 2 , lim i a i = lim j b j = e , and { a i , b i } i < ω Q ¬ S ( M ) .
Let M x y U ( x , y ) ( ¬ S ( x ) S ( y ) ) , and for all a ¬ S ( M ) , b = ( r + 2 , q ) S ( M ) , let M U ( a , b ) if and only if R a < r + 2 .
For k { 0 , 1 , 2 , } , define p k ( x ) : = { a i < x < b j | i , j < ω } { P k ( x ) } . All the p k are the complete non-isolated mutually dense types. Moreover, for each N M o d ( T h ( M ) ) and each distinct k 1 and k 2 , p k 1 c ( N ) = p k 2 c ( N ) , and this convex closure is equal to the set of all realizations of the incomplete type { a i < x < b j | i , j < ω } in N . Let q ( y ) : = { U ( a i , y ) ¬ U ( b j , y ) | i , j ω } . Then, q ( N ) = q c ( N ) , and for each k 0   p k   q       w   and p k c   q c       c w   .
Let E ( y 1 , y 2 ) : = x ¬ S ( x ) U ( x , y 1 ) U ( x , y 2 ) . Then, E is an ∅-definable equivalence relation with convex classes on S ( M ) . Then, M E ( r 1 + 2 , q 1 ) , ( r 2 + 2 , q 2 ) if and only if r 1 = r 2 . Then, the formula U is monotonic on p c ( N ) and strictly monotonic on equivalence classes on q c ( N ) . Therefore, this is an example of a theory with monotonic non-orthogonality on equivalence classes but T h ( M ) is not a theory with monotonic non-orthogonality.
In theories with monotonicity, the definition of weak convex orthogonality of 1-types coincides with the definition of weak convex orthogonality from [9].
Theorem 2
([9]). Let T be a countable linearly ordered theory with monotonic non-orthogonality, A M , M T be | A | + -saturated, and p , q S 1 ( A ) be non-isolated types. Then, p c   q c       c w   if and only if q c   p c       c w   .
Corollary 1.
Let T be a countable linearly ordered theory with monotonic non-orthogonality on equivalence classes, A M , M T be | A | + -saturated, and p , q S 1 ( A ) be non-isolated types. Then, p c   q c       c w   if and only if q c   p c       c w   .
Corollary 2.
Let T be a countable linearly ordered theory with monotonic non-orthogonality on equivalence classes, A M , M T be | A | + -saturated. Then, p c   q c       c w   is an equivalence relation on S c ( A ) .
Proof of Corollary 2.
As noted above, without loss of generality, assume that T has monotonic non-orthogonality.
From the definition it follows that p c   p c       c w   for each p c S c ( A ) . Theorem 2 proves symmetry.
Let p c , q c , r c S c ( A ) be such that p c   q c       c w   and q c   r c       c w   . Let H 1 ( x , y ) and H 2 ( x , y ) be convex A-formulas guaranteeing these two non-weak orthogonalities, respectively. We can transform these formulas so that for all α p c ( M ) , β q c ( M ) , ( H 1 ( M , α ) = ( H 1 ( M , α ) + ) , ( H 2 ( M , β ) = ( H 1 ( M , β ) + ) , and the sets H 1 ( M , α ) q c ( M ) , ¬ H 1 ( M , α ) q c ( M ) , H 2 ( M , β ) r c ( M ) and ¬ H 2 ( M , β ) r c ( M ) are all non-empty.
By compactness, there is a formula K ( z ) q c ( z ) such that the formula H 2 is a convex monotonic formula on K ( M ) splitting r c ( M ) and with ( H 2 ( M , β ) = ( H 2 ( M , β ) + ) for each β K ( M ) . Then, the formula H 3 ( x , y ) : = z K ( z ) H 1 ( z , y ) H 2 ( x , z ) guarantees that p c c w r c , thus proving transitivity. □

3. Theories with Monotonic Non-Orthogonality

Theorem 3.
Let T be a countable theory, p S 1 ( A ) , A be a finite subset of a countably saturated model M T . If p is non-isolated, then there exists a countable family of 1-A-formulas { φ i ( x ) } i < ω such that i < ω φ i ( M ) = p ( M ) and φ i + 1 ( M ) φ i ( M ) for all i < ω .
Proof of Theorem 3.
Let { θ i } i < ω be an enumeration of all formulas of p. Denote φ 1 : = θ 1 . Let i > 1 be the smallest index such that θ 1 ( M ) θ i ( M ) p ( M ) . Such a formula exists since the type p is non-isolated. Denote φ 2 : = θ i . Continuing this construction by induction, we obtain a countable family { φ i } i < ω of nested formulas. By construction, i < ω φ i ( M ) p ( M ) .
Note that for each i < ω there is j < ω such that φ j ( M ) θ i ( M ) . This is true because on step i either θ i is chosen as φ i , or a smaller formula has already been chosen before, that is, φ i 1 ( M ) θ i ( M ) .
Towards a contradiction, suppose that there is c i < ω φ i ( M ) p ( M ) . Then, there is φ p such that c φ ( M ) . For some k < ω , φ = θ k . Then, there is k k such that φ k ( M ) φ ( M ) = θ k ( M ) . This is a contradiction with the choice of c. Therefore, i < ω φ i ( M ) = p ( M ) . □
The proof of Theorem 3 can be repeated for convex types by considering only convex formulas. Then, the following holds.
Corollary 3.
Let T be a countable linearly ordered theory, p S 1 ( A ) , A be a finite subset of a countably saturated model M T . If p c is non-isolated, then there exists a countable family of convex 1-A-formulas { φ i ( x ) } i < ω such that i < ω φ i ( M ) = p c ( M ) and φ i + 1 ( M ) φ i ( M ) for all i < ω .
Theorem 4.
Let T be a small theory with monotonic non-orthogonality on equivalence classes. Let Γ be a pairwise weakly convex orthogonal set of non-isolated convex types from S c ( A ) for a finite set A. Then, Γ is weakly convex orthogonal.
As previously, without loss of generality, assume that T has monotonic non-orthogonality.
Proof of Theorem 4.
Analogically to L. Mayer’s proof (Theorem 2.4 from [2]), it is sufficient to confirm the following claim.
Claim 1.
Let Γ be a finite weakly convex orthogonal set of non-isolated convex 1-types from S c ( A ) . If q c S c ( A ) is such that Γ q c is not weakly convex orthogonal, then there is p c Γ such that q c   p c       c w   .
The proof is by induction on n : = | Γ | . The case when n = 2 is trivial.
Let n > 2 . For induction, assume that the claim holds for all m < n . Let Γ = { p 1 c , p 2 c , , p n c } be a weakly orthogonal set of non-isolated 1-types from S 1 c ( T ) . Since all p i c are non-isolated, without loss of generality, we can assume that each p i c ( M ) is non-definable. That is, for each i < ω , p i is either irrational or quasirational to the right.
Let H ( z , x 1 , , x n ) be an A-definable formula such that for some α 1 p 1 c ( M ) , α 2 p 2 c ( M ) , …, α n p n c ( M ) , the set H ( M , α 1 , α 2 , , α n ) is convex, there are γ 1 , γ 2 q c ( M ) , γ 1 ( q c ( M ) H ( M , α 1 , α 2 , , α n ) ) < γ 2 , and q c ( M ) H ( M , α 1 , α 2 , , α n ) . Let for each i, 1 i n , P i p i be such that H ( z , x 1 , , x n ) is monotonic in z on P 1 ( M ) , P n ( M ) with respect to each x i , 1 i n , without loss of generality, let H be strictly increasing in z for each i.
Let φ 1 , φ 2 be such convex A-formulas that P 1 ( M ) φ 1 ( M ) φ 2 ( M ) , φ 1 ( M ) + φ 2 ( M ) + p 1 c ( M ) . Without loss of generality, let φ 1 ( M ) = φ 2 ( M ) = . Such two formulas exist because of Corollary 3. For each i { 1 , 2 } , denote
R i ( z , α 2 , , α n ) : = x ( φ i ( x ) P 1 ( x ) H ( z , x , α 2 , , α n ) ) .
Monotonicity of H implies R 1 ( M , α 2 , , α n ) R 2 ( M , α 2 , , α n ) < q ( M ) . Let { ψ j } j < ω be the sequence of convex formulas defining p 2 c ( M ) as in Corollary 3. Denote
K j ( z , α 3 , , α n ) : = x y ( H ( z , x , y , α 3 , α n ) φ 2 ( x ) ψ j ( y ) P 2 ( y ) )
While j approaches infinity, K j ( M , α 3 , , α n ) approaches R 2 ( M , α 2 , , α n ) . Monotonicity and compactness imply the existence of t < ω such that R 1 ( M , α 2 , , α n ) K t ( M , α 3 , , α n ) R 2 ( M , α 2 , , α n ) .
Denote φ ( x , α 2 , , α n ) : = z ( K t ( z , α 3 , , α n ) H ( z , x , α 2 , , α n ) φ 2 ( x ) ) . Then, ( P 1 ( M ) φ 1 ( M ) ) ( P 1 ( M ) φ ( M ) ) ( P 1 ( M ) φ 2 ( M ) ) . The pairs of formulas φ 1 , φ and φ , φ 2 behave analogically to the pair φ 1 , φ 2 . Then, we can apply the previous consideration to construct two convex formulas K 0 and K 1 such that R 1 ( M , α 2 , , α n ) K 0 ( M , α 3 , , α n ) K t ( M , α 3 , , α n ) K 1 ( M , α 3 , , α n ) R 2 ( M , α 2 , , α n ) .
For each i { 0 , 1 } , and later, for each finite sequence of zeroes and ones, denote φ i ( x , α 2 , , α n ) : = z ( K i ( z , α 3 , , α n ) H ( z , x , α 2 , , α n ) φ 2 ( x ) ) . Then, ( P 1 ( M ) φ 1 ( M ) ) ( P 1 ( M ) φ 0 ( M ) ) ( P 1 ( M ) φ ( M ) ) ( P 1 ( M ) φ 1 ( M ) ) ( P 1 ( M ) φ 2 ( M ) ) .
Using the new pairs of formulas, we can continue dividing the definable sets: φ 1 , φ 0 produce K 00 , φ 0 , φ produce K 01 , φ , φ 1 produce K 10 , and φ 1 , φ 2 produce K 11 .
Repeating this construction, for each finite sequence τ of zeroes and ones we obtain a convex formula K τ such that K τ 00 ( M , α 3 , , α n ) K τ 0 ( M , α 3 , , α n ) K τ ( M , α 3 , , α n ) K τ 10 ( M , α 3 , , α n ) K τ 1 ( M , α 3 , , α n ) K τ 11 ( M , α 3 , , α n ) . This gives us a continuum of 1-types over { α 3 , , α n } , which contradicts the theory T t p ( α 3 , , α n ) being small. □
Theorem 5
([18]). Let M T be a model of a small countable complete theory T. Let B M be countable. Then, there exists a countable model A T such that B A and for every a ¯ A there is b ¯ B , such that t p ( a ¯ / b ¯ ) is isolated.
Corollary 4.
Let T be a countable complete linearly ordered theory with monotonic non-orthogonality on equivalence classes, and let Γ be an infinite family of pairwise weakly convex orthogonal convex 1-types from S c ( A ) for a finite set A. Then, I ( T , 0 ) = 2 0 .
Proof Corollary 4.
Without loss of generality, let the theory T have monotonic non-orthogonality. It is enough to only consider the case when T is small. Since otherwise the theory T has 2 0 countable non-isomorphic models. Extend the language of T to L ( A ) , where L is the language of T, and work in the theory T t p ( a ¯ ) , where a ¯ is some enumeration of the set A. Let N be an 1 -saturated elementary extension of M .
Fix an arbitrary enumeration Γ = { p 1 c , p 2 c , , p i c , } i < ω . Let τ = τ 1 , τ 2 , , τ i , , τ i { 0 , 1 } , be an arbitrary infinite sequence of zeroes and ones. Denote I τ : = { i < ω | τ i = 1 } . Since p i c ( N ) , for each i < ω , we can choose a special set of representatives B τ = { β i } i I τ N of realizations of p i c ’s such that for each i I τ   β i p i c ( N ) . Let A τ T be the model which exists by Theorem 5 applied to the set B τ .
Let j < ω be such that j I τ . We claim that p j c ( A τ ) = . Towards a contradiction suppose that there is α p j c ( A τ ) . Then, by Theorem 5, there is a tuple β ¯ B τ such that t p ( α / β ¯ ) is isolated. Let H ( x , β ¯ ) be the isolating formula of t p ( α / β ¯ ) . Then, H ( A τ , β ¯ ) = t p ( α / β ¯ ) ( A τ ) . We have that t p ( α / β ¯ ) t p ( α ) p j c ( A τ ) . Since the type p j c is non-isolated, H ( A τ , β ¯ ) p j c ( A τ ) . Then, we obtain H c ( A τ , β ¯ ) p j c ( A τ ) .
By construction of B τ , β ¯ = ( β i 1 , β i 2 , , β i n ) for some distinct i 1 , i 2 , i n I τ , where n = l n ( β ¯ ) . Then, H c ( A τ , β ¯ ) guarantees that the family Γ is not convex weakly orthogonal. But this is impossible since, by Theorem 4, the pairwise weakly convex orthogonal family Γ should be weakly convex orthogonal.
Since we have obtained a contradiction, p j c ( A τ ) = . Because j I τ is arbitrary, A τ realizes all p i with i I τ , and omits all p j with j I τ . Therefore, for different infinite sequences τ 1 and τ 2 of zeroes and ones, the models A τ 1 and A τ 2 are non-isomorphic. This leads to continuum countable non-isomorphic models of the theory T t p ( a ¯ ) , as well as of the theory T. □

4. Weakly O-Minimal Theories

Let M T be an | A | + -saturated model of a weakly o-minimal theory T for A M .
Definition 13
([12]). (1) An A-definable formula φ ( x , y ) is said to be p–preserving (p-stable) if there exist α, γ 1 , γ 2 p ( M ) such that p ( M ) φ ( M , α ) { α } and γ 1 < φ ( M , α ) < γ 2 .
(2) A p-preserving formula φ ( x , y ) is said to be convex to the right (left) on p if there exists α∈ p ( M ) such that p ( M ) φ ( M , α ) is convex in the set p ( M ) (that is, γ 1 , γ 2 ( p ( M ) φ ( M , α ) ) , δ p ( M ) and γ 1 < δ < γ 2 imply δ φ ( M , α ) ), α is the left (right) endpoint of the set φ ( M , α ) , and α φ ( M , α ) .
The family of all p-preserving convex to the right (left) A-formulas is denoted by C R F ( p ) ( C L F ( p ) ). The set of all convex to the right (left) formulas on a 1-type is linearly ordered by inclusion. Such formulas play an important role in [6,7,8,19], as well as in other works by the authors.
Definition 14
([12]). (1) A type p S 1 ( A ) is quasisolitary if there exists a greatest convex to the right (equivalently, convex to the left) on p formula.
(2) A type p S 1 ( A ) is social if there exist no greatest convex to the right (equivalently, convex to the left) on p formula.
Definition 15
([12]). The type p is not almost orthogonal to the type q, p   q       a   , if there exists an A-definable formula H ( x , y ) , such that for some α p ( N ) and γ 1 , γ 2 q ( N ) , γ 1 < H ( N , α ) < γ 2 and H ( N , α ) q ( N ) .
Note 1
([12]). Let T be a weakly o-minimal theory, let A be a subset of an | A | + -saturated model M T . Then, the relations w and a are equivalence relations on S 1 ( A ) .
Recall that in weakly o-minimal theories, the set of all realizations of each complete 1-type is convex. Then, for such theories p c c w q c if and only if p w q . Hence, we do not need to distinguish 1-types from their convex closures.
Proposition 1.
Let T be a weakly o-minimal theory, A M , and M T be | A | + -saturated. Let Γ = { p 1 , p 2 , , p n } S ( A ) be a non-weakly orthogonal family of non-isolated 1-types such that each proper subset Γ Γ is weakly orthogonal. Then, there exists an A-definable formula H ( y 1 , y 2 , , y n ) that satisfies Definition 9 such that for all 1 i n , the formula H ( y 1 , y 2 , , y n ) is convex in y i and for all α 1 p 1 ( M ) , α 2 p 2 ( M ) , , α i 1 p i 1 ( M ) , p i + 1 ( M ) , , α n p n ( M ) ,
H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) p i ( M ) ,
¬ H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) p i ( M ) ,   and   either
¬ H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) = H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) +   or
¬ H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) = H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n )
Proof of Proposition 1.
Non-weak orthogonality of Γ implies that there are an n-A-formula H 0 and realizations α 1 p 1 ( M ) , α 2 p 2 ( M ) , , α n p n ( M ) such that M H 0 ( α 1 , α 2 , . . . , α n ) and for some i, 1 i n , and some α i p i ( M ) we have M ¬ H 0 ( α 1 , α 2 , . . . , α i 1 , α i , α i + 1 , . . . , α n ) . Then for any arbitrary j i ( 1 j n ), there exists α j p j ( M ) such that M ¬ H 0 ( α 1 , α 2 , . . . , α j 1 , α j , α j + 1 , . . . , α n ) . Let us prove this.
Denote α ¯ i j : = { α 1 , . . . , α n } { α i , α j } , p i : = t p ( α i / A α ¯ i j ) , p j : = t p ( α j / A α ¯ i j ) , and let H 0 i j ( x , y ) : = H 0 ( α 1 , . . . α j 1 , y , α j + 1 , . . . , α i 1 , x , α i + 1 , . . . , α n ) . Since { p 1 , p 2 , . . . , p n } { p i } and { p 1 , p 2 , . . . , p n } { p j } are orthogonal families of 1-types, then p i ( M ) = p i ( M ) and p j ( M ) = p j ( M ) . Since α i H 0 i j ( M , α j ) p i ( M ) and α i ¬ H 0 i j ( M , α j ) p i ( M ) , we have that p j w p i .
By Note 1 the relation of non-weak orthogonality is symmetric, therefore, p i w p j and there exits α j p j ( M ) such that M ¬ H 0 ( α 1 , α 2 , . . . , α j 1 , α j , α j + 1 , . . . , α n ) .
Denote α ¯ i : = ( α 1 , α 2 , . . . , α i 1 , α i + 1 , . . . , α n ) . To simplify the notation, until the end of this proof, we move the free variable of H forward. Denote H ( x , α ¯ i ) : = H ( α 1 , α i 1 , x , α i + 1 , . . . , α n ) . Note that the free variable in the new notation can correspond to realizations of different p i ’s depending on i.
We construct an n-A-formula H ( x 1 , x 2 , . . . , x n ) such that M H ( α 1 , α 2 , . . . , α n ) and for each i ( 1 i n ) the following holds: H ( M , α ¯ i ) p i ( M ) , ¬ H ( M , α ¯ i ) p i ( M ) , and either ¬ H ( M , α ¯ i ) = H ( M , α ¯ i ) + or ¬ H ( M , α ¯ i ) = H ( M , α ¯ i ) .
( i + 1 ) We define H i + 1 by induction on i ( 0 i n 1 ) . Consider H i ( M , α ¯ i ) = k H i , k ( M , α i ) , where H i , k are all the convex parts of H i ( x , α ¯ i ) . Denote by H i c ( x , α ¯ i ) the convex part of H i ( x , α ¯ i ) such that α i H i , k ( M , α i ) .
H i + 1 ( y , α ¯ i ) : = x ( H i c ( x , α ¯ i ) x < y ) , if α i < α i . Here, H i + 1 ( y , α ¯ i ) = H i c ( y , α ¯ i ) + .
H i + 1 ( y , α ¯ i ) : = x ( H i c ( x , α ¯ i ) y < x ) , if α i < α i . Here, H i + 1 ( y , α ¯ i ) = H i c ( y , α ¯ i ) .
H i + 1 ( y , α ¯ i ) : = x ( H i + 1 ( x , α ¯ i ) y < x ) , if α i < α i . Here, H i + 1 ( y , α ¯ i ) = ( H i c ( y , α ¯ i ) + ) .
H i + 1 ( y , α ¯ i ) : = x ( H i + 1 ( x , α ¯ i ) y < x ) , if α i < α i . Here, H i + 1 ( y , α ¯ i ) = ( H i c ( y , α ¯ i ) ) + .
It follows from the definition of H i + 1 ( y , α ¯ i ) that M H i + 1 ( α i , α ¯ i ) ¬ H i + 1 ( α i , α ¯ i ) .
Suppose that α i < α i . Denote S i ( α ¯ i ) : = y H i + 1 ( y , α ¯ i ) + ¬ H i + 1 ( y , α ¯ i ) and α ¯ i = α j , α ¯ i j for any j i ( 1 j n ) . Since α ¯ i realizes a weakly orthogonal subset of Γ , then M S i ( α j , α ¯ i j ) implies the existence of Θ j i ( x j ) p j such that M x j ( Θ j i ( x j ) S i ( x j , α ¯ i j ) ) . For the case α i < α i , the formula S i ( α ¯ i ) : = y ( H i + 1 ( y , α ¯ i ) ¬ H i + 1 ( y , α ¯ i ) ) satisfies for convenient Θ j i ( x j ) p j , M x j ( Θ j i ( x j ) S i ( x j , α ¯ i j ) ) . Now define H i + 1 ( x j , α ¯ j ) for j i :
if j < i , let H i + 1 ( x j , α ¯ j ) : = H j + 1 ( x j , α ¯ j ) ;
if i < j , let H i + 1 ( x j , α ¯ j ) : = H 0 ( x j , α ¯ j ) . For each j i ( 1 j n ), let Θ j ( x j ) : = i Θ j i ( x j ) .
Denote H ( x 1 , x 2 , . . . , x n ) : = H n ( x 1 , x 2 , . . . , x n ) j Θ j ( x j ) . Following the definition for each i ( 1 i n ), we have M H ( α i , α ¯ i ) ¬ H ( α i , α ¯ i ) and either ¬ H ( M , α ¯ i ) = H ( M , α ¯ i ) + or ¬ H ( M , α ¯ i ) = H ( M , α ¯ i ) . □
Below, the notations from [11] are modified for consistency. For instance, the formula H in this article acts as the formula Φ from [11]. And we let H ( M , y ) to be defining a convex set starting from negative infinity as a representation of the right border of Φ ( M , y ) .
Let T be a weakly o-minimal theory, A be a finite and I be an infinite subset of an | I | + -saturated model M T . Let H ( x , y ) be a convex A-formula such that for each a I , H ( M , a ) = ( H ( M , a ) + ) .
Definition 16
([10]). The formula H ( x , y ) is tidy on I if one of the following holds:
(1) The formula H is locally increasing on I, that is, for each a I there is an interval J I such that a J and H strictly increases on J;
(2) The formula H is locally decreasing on I, that is, for each a I there is an interval J I such that a J and H strictly decreases on J;
(3) The formula H is locally constant on I, that is, for each a I there is an interval J I such that a J and H is constant on J.
Let H ( x , y ) be a convex A-formula such that for each a I , H ( M , a ) = ( H ( M , a ) + ) . Denote
ψ 0 ( y ) : = y 1 y 2 y 1 < y < y 2 z 1 z 2 y 1 < z 1 < z 2 < y 2 x ( H ( x , z 1 ) H ( x , z 2 ) ) ;
ψ 1 ( y ) : = y 1 y 2 y 1 < y < y 2 z 1 z 2 y 1 < z 1 < z 2 < y 2 t ( ¬ H ( t , z 1 ) H ( t , z 2 ) ) ;
ψ 2 ( y ) : = y 1 y 2 y 1 < y < y 2 z 1 z 2 y 1 < z 1 < z 2 < y 2 t ( H ( t , z 1 ) ¬ H ( t , z 2 ) ) .
The formula ψ 0 ( x ) means that there is an interval around y on which H is constant. Analogically, ψ 1 and ψ 2 mean that on some interval around y the formula H increases or decreases, respectively. Thus, x H ( x , M ) = ψ 0 ( M ) ψ 1 ( M ) ψ 2 ( M ) X [10]. Since the theory T is weakly o-minimal, each ψ i ( M ) is a finite union of convex sets and X is a finite set. Thus, for any i { 0 , 1 , 2 } , ψ i ( M ) = j ψ i j ( M ) .
Below we study the behavior of the formula H on the convex formula ψ i j and give the definition of the depth of H on ψ i j .
Let
ε 0 j ( y 1 , y 2 ) : = ψ 0 j ( y 1 ) ψ 0 j ( y 2 ) z y 1 z y 2 y 2 z y 1 x H ( x , y 1 ) H ( x , z ) ) ; ε 1 j ( y 1 , y 2 ) : = ψ 1 j ( y 1 ) ψ 1 j ( y 2 ) ( y 1 < y 2 z 1 z 2 ( y 1 < z 1 < z 2 < y 2 t 1 t 2 t 3 ( ¬ H ( t 1 , y 1 ) H ( t 1 , z 1 ) ¬ H ( t 2 , z 1 ) H ( t 2 , z 2 ) ¬ H ( t 3 , z 2 ) H ( t 3 , y 2 ) ) ) ) ( y 2 < y 1 z 1 z 2 ( y 2 < z 1 < z 2 < y 1 t 1 t 2 t 3 ( ¬ H ( t 1 , y 2 ) H ( t 1 , z 1 ) ¬ H ( t 2 , z 1 ) H ( t 2 , z 2 ) ¬ H ( t 3 , z 2 ) H ( t 3 , y 1 ) ) ) ) ;
ε 2 j ( y 1 , y 2 ) : = ψ 2 j ( y 1 ) ψ 2 j ( y 2 ) ( y 1 < y 2 z 1 z 2 ( y 1 < z 1 < z 2 < y 2 t 1 t 2 t 3 ( ¬ H ( t 1 , y 2 ) H ( t 1 , z 2 ) ¬ H ( t 2 , z 2 ) H ( t 2 , z 1 ) ¬ H ( t 3 , z 1 ) H ( t 3 , y 1 ) ) ) ) ( y 2 < y 1 z 1 z 2 ( y 2 < z 1 < z 2 < y 1 t 1 t 2 t 3 ( ¬ H ( t 1 , y 1 ) H ( t 1 , z 2 ) ¬ H ( t 2 , z 2 ) H ( t 2 , z 1 ) ¬ H ( t 3 , z 1 ) H ( t 3 , y 2 ) ) ) ) .
These three relations indicate pairs of elements, on the intervals between which the formula H is constant ( ε 0 j ), strictly increases ( ε 1 j ), or strictly decreases ( ε 2 j ). From the definitions it follows that for each i { 0 , 1 , 2 } , M y ψ i ( y ) y ε i j ( y , y ) . For each a M , the sets ε 0 j ( M , a ) , ε 1 j ( M , a ) , ε 2 j ( M , a ) are maximal convex sets containing a, on which H is constant, strictly increases or strictly decreases, respectively. Next, we look at ε i j ( M , a ) , where i { 0 , 1 , 2 } , and a belongs to the convex part ψ i j ( M ) of ψ i ( M ) .
We consider the following three cases.
i = 0 . Let ψ 0 j ( y ) be an arbitrary convex part of the formula ψ 0 ( y ) . If for some α ψ 0 j ( M ) , we have ψ 0 j ( M ) = ε 0 j ( M , α ) , then in this case we say, that the depth of the formula H ( x , y ) on ψ 0 j ( M ) is equal to zero. If the set of all ε 0 j -classes is finite, then because each ε 0 j -class is A-definable, the depth of the A-formula H ( x , y ) on each ε 0 j -class is equal to zero. If the set of all ε 0 j classes is infinite, then the linear ordering on these classes is dense. In the paper, we assume that the order is dense since discrete ordering implies maximality of the number of countable non-isomorphic models [15,16]. In this case, we say that the depth of the formula H on ψ 0 j is at least 1. Notice that then the formula ψ 0 j ( x ) can be refined to A-formulas ψ 01 j ( x ) and ψ 02 j ( x ) in the following way.
We say that M ψ 01 j ( α ) if M ψ 0 j ( α ) and there is an interval around α on which H increases up to ε 0 . And let ε 01 j ( M , α ) be the maximal convex set containing α on which H increases up to ε 0 j . That is, if β ε 01 j ( M , α ) and α < β , then M ψ 0 j ( β ) and H ( M , α ) H ( M , γ ) H ( M , β ) for each γ with ε 0 j ( M , α ) < ε 0 j ( M , γ ) < ε 0 j ( M , β ) .
We say that M ψ 02 j ( α ) if M ψ 0 j ( α ) and there is an interval around α on which H decreases up to ε 0 j . And let ε 02 ( M , α ) be the maximal convex set containing α on which H decreases up to ε 0 j . That is, if β ε 02 j ( M , α ) and α < β , then M ψ 0 j ( β ) and H ( M , β ) H ( M , γ ) H ( M , α ) for each γ with ε 0 j ( M , α ) < ε 0 j ( M , γ ) < ε 0 j ( M , β ) .
i = 1 . Let ψ 1 j ( y ) be a convex part of the formula ψ 1 ( y ) . If for some α ψ 1 j ( M ) , ε 1 j ( M , α ) = ψ 1 j ( M ) , we say that the depth of the formula H on ψ 1 j is equal to 1.
If α 1 , α 2 , . . . , α m ψ 1 j ( M ) , i < ω , are representatives of distinct ε 1 j -classes such that 1 k m ε 1 j ( M , α k ) = ψ 1 j ( M ) , then denote ψ 1 j , k ( y ) : = ε 1 j ( y , α k ) . Since there is only a finite number of ε 1 j -classes, each of them is A-definable. Then for each k, 1 k m the depth of H on ψ 1 j , k ( y ) is equal to 1.
If the set of ε 1 j -classes is infinite, then the linear ordering on these classes is dense and the depth of the formula ψ 1 ( x ) is greater than or equal to 2. Consider two elements α , β ψ 1 j ( M ) such that α < β and M ¬ ε 1 j ( α , β ) . Suppose H ( M , α ) H ( M , β ) . If for each γ , α < γ < β implies H ( M , α ) H ( M , γ ) H ( M , β ) , then β ε 1 j ( M , α ) , what contradicts the initial condition. So, there is γ 1 such that α < γ 1 < β and H ( M , γ 1 ) H ( M , α ) . Assume that for each γ i there exist β i 1 , β i such that α < β i < γ i < β i 1 < β , M ¬ ε 1 j ( α , β i ) . and H ( M , α ) H ( M , β i ) . Then the formula α < y H ( M , y ) H ( M , α ) has an infinite number of elements { β i | i < ω } which satisfy it and alternate with the elements from the set { γ i | i < ω } . This contradicts the definition of a weakly o-minimal theory. Thus
for each α ψ 1 j ( M ) there is γ ψ 1 j ( M ) such that M α < γ ¬ ε 1 j ( α , γ ) H ( M , γ ) H ( M , α ) y ( α < y < γ ¬ ε 1 j ( α , y ) ) H ( M , y ) H ( M , α ) .
Introduce a new formula H 1 ( x , y ) : = z ( ε 1 j ( z , y ) H ( x , z ) ) . This formula is locally constant on ψ 1 j ( M ) . From (1) it follows that H 1 is decreasing on ψ 1 j / ε 1 j . Consider the formula ε 12 j ( x , y ) : = ( x < y ¬ ε 1 j ( x , y ) z ( ( x < z < y ¬ ε 1 j ( x , z ) ¬ ε 1 j ( z , y ) ) H ( M , x ) H ( M , z ) H ( M , y ) ) ) ( y < x ¬ ε 1 j ( x , y ) z ( ( y < z < x ¬ ε 1 j ( x , z ) ¬ ε 1 j ( z , y ) ) H ( M , y ) H ( M , z ) H ( M , x ) ) ) . This formula is a relation of equivalence ψ 1 j ( M ) and each ε 12 j -class contains an infinite number of ε 1 j -classes. If ε 12 j ( M , α ) = ψ 1 j ( M ) for some α ψ 1 j ( M ) , then we say that the depth of H on ψ 1 j ( M ) is equal to 2.
If there exists a finite number of elements α 1 , α 2 , , α m ψ 1 j ( M ) from different ε 12 j -classes such that 1 k m ε 12 j ( M , α k ) = ψ 1 j ( M ) , then denote ψ 1 j , k ( y ) : = ε 12 j ( y , α k ) for each 1 k m . Since the number of ε 12 j -classes is finite, each of these classes is definable. Then for each k, 1 k m the depth of H on ψ 1 j , k ( y ) is equal to 2.
If the set of ε 12 j classes is infinite, then the linear ordering on these classes is dense and the depth of the formula ψ 1 j ( x ) is greater than or equal to 3.
i = 2 . This case is analogical to the case i = 1 , instead of decreasing increasing classes we have increasing decreasing classes from the same consideration based on the next condition (2):
for each α ψ 2 j ( M ) there is γ ψ 2 j ( M ) such that M α < γ ¬ ε 2 j ( α , γ ) H ( M , α H ( M , γ ) y ( α < y < γ ¬ ε 2 j ( α , y ) ) H ( M , α ) H ( M , y ) .
Each ε 2 j -class consists of ε 21 j -classes such that the formula H decreases on ε 2 j ( M , α ) and increases on representatives of distinct ε 21 j -classes of elements from ε 2 j ( M , α ) .
Let α ψ i j ( M ) . Consider the three next formulas:
ψ 1 j ( y ) α < y ¬ ε 1 j ( α , y ) H ( M , y ) H ( M , α ) ;
ψ 2 j ( y ) α < y ¬ ε 2 j ( α , y ) H ( M , α ) H ( M , y ) ;
ψ 0 j ( y ) α < y ¬ ε 0 j ( α , y ) H ( M , y ) H ( M , α ) .
Since the theory is weakly o-minimal, in the case ψ i j ( M ) , each of these formulas has a finite number of convex parts. This number determines the depth of the formula H on ψ i j ( M ) [11]. Thus, there is only a finite number of equivalence relations { E k ( x , y ) | 1 k n } with convex classes on ψ i j ( M ) such that for each k ( 1 k n ), each E k -class contains an infinite number of E k 1 -classes, the number of E n -classes is finite, and for each k 1   E k is some ε i 1 i 2 i k j , where i t { 1 , 2 } and i t = 1 ( i t = 2 ) implies i t + 1 = 2 ( i t + 1 = 1 ) for all 1 t k .
Then there exists a finite number of elements α 1 , α 2 , . . . , α m ψ 1 j ( M ) from different E n -classes such that 1 s m E n ( M , α s ) = ψ 1 j ( M ) . Thus, denote ψ 1 j , s ( y ) : = E n ( y , α s ) . Since there is a finite number of E n -classes, each of these classes is definable. Then for each s ( 1 s m ) the depth of H on ψ 1 j , s ( y ) is equal to n.
The formula H n ( x , y ) : = z ( E n 1 ( z , y ) H ( x , z ) ) is strictly monotonic on ψ i j , s / E n 1 . This means if α , β ψ i j , s ( M ) are such that M ¬ E n 1 ( α , β ) α < β , then M H n ( M , β ) H n ( M , α ) implies M x y ( ( ψ i j , s ( x ) ψ i j , s ( y ) ¬ E n 1 ( x , y ) x < y ) H n ( M , y ) H n ( M , x ) ) , and M H n ( M , α ) H n ( M , β ) implies M x y ( ( ψ i j , s ( x ) ψ i j , s ( y ) ¬ E n 1 ( x , y ) x < y ) H n ( M , x ) H n ( M , y ) ) .
Thus, taking into consideration the definition of the depth of the 2-formula H, we obtain the following.
Proposition 2.
Let p , q S 1 ( A ) be two non-isolated 1-types over A, and H be a 2-A-formula such that for each α p ( M ) , we have ( H ( M , α ) + ) = H ( M , α ) , H ( M , α ) q ( M ) , and ¬ H ( M , α ) q ( M ) . Then there exists k ( 1 k n ), where n is the depth of H on the corresponding ψ i j ( y ) , such that H k is strictly monotonic on Θ / E k 1 for some convex formula Θ ( y ) p , which is a subformula of some E k -class, and for each α p ( M ) , E k 1 ( M , α ) p ( M ) .
In Ref. [11], a natural generalization of the notions from [10] was given.
Definition 17
([11]). If H and I are as in Definition 16, then H is n-tidy on I if the following holds:
(1) For each a , b , c I if a < b < c and H ( M , a ) = H ( M , c ) , then H ( M , a ) = H ( M , b ) ;
(2) The formula H n is tidy on I / E n 1 , where H n ( x , y ) : = z ( E n 1 ( y , z ) H ( x , z ) ) ;
(3) For each a I   E n ( I , a ) / E n 1 has no minimum and no maximum;
(4) | I / E n |     0 ;
Where E n is an equivalence relation on I such that for each a , b I   M E n ( b , a ) if and only if either M E n 1 ( b , a ) , or M ¬ E n 1 ( a , b ) a < b implies that ( H n [ a , b ] ) / E n 1 is strictly monotonic, or M ¬ E n 1 ( a , b ) b < a implies that ( H n [ b , a ] ) / E n 1 is strictly monotonic. And 0-tidy is tidy, H 0 ( x , y ) : = H ( x , y ) , and E 0 ( x , y ) : = x = y .
Definition 18
([11]). If H and I are as in Definition 16, the formula H is strongly tidy on I if there exists n < ω such that H is ( n 1 ) -tidy on I and H n is strictly monotonic on I / E n 1 . Then the depth of H on I equals n.
The notion of the depth of a formula was applied in studying o-stable ordered groups of finite convexity rank [20].
Definition 19.
A weakly o-minimal structure M is said to have strong monotonicity [11] (monotonicity [10]) if for each convex formula H ( x , y , a ¯ ) with M x H ( M , x , a ¯ ) = ( H ( M , x , a ¯ ) + ) , there is m < ω and a partition of d o m ( H ( M , y , a ¯ ) ) into definable sets X , I 1 , , I m such that X is finite, each I i is convex, and the formula H ( x , y , a ¯ ) is strongly tidy (tidy) on each I i .
Definition 20
([11]). Let M be a weakly o-minimal structure. Then M has finite depth, if for each convex formula H ( x , y , z ¯ ) with M x z ¯ H ( M , x , z ¯ ) = ( H ( M , x , z ¯ ) + ) there is n < ω such that for each a ¯ M and each convex set I d o m ( H ( M , y , a ¯ ) ) on which H ( x , y , a ¯ ) is strongly tidy, the depth of H ( x , y , a ¯ ) on I is less than n.
Theorem 6
([10]). If all models of T h ( M ) are weakly o-minimal, then M has monotonicity.
Theorem 7
([11]). If all models of T h ( M ) are weakly o-minimal, then M has strong monotonicity and finite depth.
Proposition 3.
Weakly o-minimal theories are theories with monotonic non-orthogonality on equivalence classes.
Proof of Proposition 3.
Let A M be finite, M T be | A | + -saturated, n < ω , and Γ = { p 1 , p 2 , , p n } be a non-weakly orthogonal family of non-isolated types from S 1 ( A ) such that each Γ Γ is weakly orthogonal. Since T is weakly o-minimal, each of the types from Γ has a convex set of all realizations.
Since Γ is non-weakly orthogonal, take the formula H ( y 1 , y 2 , , y n ) from Proposition 1. Then for all 1 i n , the formula H ( y 1 , y 2 , , y n ) is convex in y i and for all α 1 p 1 c ( M ) , α 2 p 2 ( M ) , , α i 1 p i 1 ( M ) , p i + 1 ( M ) , , α n p n ( M ) ,
H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) p i ( M ) ,
¬ H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) p i ( M ) ,   and   either
¬ H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) = H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) +   or
¬ H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) = H ( α 1 , α 2 , , α i 1 , M , α i + 1 , , α n ) .
By Proposition 2, for the formula H 1 , i α ¯ ( y i , y 1 ) , there exists an A α ¯ -formula Θ ( y 1 ) t p ( α 1 / A α ¯ ) = p 1 and an A α ¯ -definable equivalence relation E 1 such that H 1 , i α ¯ ( y i , y 1 ) / E 1 is strictly monotonic on Θ ( M ) . Notice that since t p ( α ¯ / A ) w p 1 , we have that p 1 ( M ) = p 1 ( M ) . Then H 1 , i α ¯ ( y i , y 1 ) is strictly monotonic on Θ ( M ) / E 1 ( x , y , α ¯ ) for each α ¯ = ( α 2 , , α i 1 , α i + 1 , , α n ) p 2 ( M ) × × p i 1 ( M ) × p i + 1 ( M ) × p n ( M ) .
The same holds when an arbitrary pair j k , are taken instead of 1 and i. □
Because of Proposition 3 all the results in the previous sections regarding theories with monotonic non-orthogonality on equivalence classes hold for weakly o-minimal theories. In particular, Proposition 3 implies the following.
Corollary 5.
Let T be a weakly o-minimal theory, and let Γ be an infinite family of pairwise weakly orthogonal non-isolated 1-types over a finite set A. Then T ( T , 0 ) = 2 0 .
Corollary 6.
Let T be a weakly o-minimal theory having less than 2 0 models. Then there is no infinite family of pairwise weakly orthogonal 1-types over a finite set.
Definition 21.
([12]) Let p S 1 ( A ) , B M such that M is | B A | + -saturated. Then a neighborhood of the set B in the type p is the following set:
V p ( B ) : = { γ M there exist γ 1 , γ 2 p ( M ) and a formula H ( x , b ¯ , c ¯ ) , b ¯ B , c ¯ A , such that γ 1 < H ( M , b ¯ , c ¯ ) < γ 2 , γ H ( M , b ¯ , c ¯ ) } .
Let α ¯ = α 1 , α 2 , , α k then V p ( α ¯ ) : = V p ( { α 1 , α 2 , , α k } ) .
Note that for each α p ( M ) , V p ( α ) = φ C R F ( p ) C L F ( p ) φ ( M , α ) . Indeed, if H ( x , α ) is an ( A { α } ) -definable formula as in the definition, then, if non-empty, ( H ( x , α ) + ) ( x α ) is a p-preserving convex to the right formula, and ( H ( x , α ) ) + ( x α ) is a p-preserving convex to the left formula.
Note 2
([12]). Let p , q S 1 ( A ) . Then p is almost orthogonal to q (denoted p a q ) if and only if for some (equivalently, for every) α p ( M ) , V q ( α ) = .
The following theorem was previously proven in [12]. Below, we present an alternative proof of this theorem, along with its important corollary.
Theorem 8.
Let T be a weakly o-minimal theory, let p , q S 1 ( A ) for some subset A of an | A | + -saturated model M T . Then if p   q       w   and p is social, then p   q       a   and q is social.
Proof of Theorem 8.
Let p   q       w   and p be social. Then there is a convex A-formula H ( x , y ) such that for each α p ( M ) the sets H ( M , α ) q ( M ) and ¬ H ( M , α ) q ( M ) are non-empty, ¬ H ( M , α ) = H ( M , α ) + , or, equivalently, H ( M , α ) = ( ¬ H ( M , α ) ) .
For each φ ( C R F ( p ) C L F ( p ) ) , denote S φ ( x , α ) : = y ( φ ( y , α ) H ( x , y ) ) . Fix arbitrary α p ( M ) .
(a) Suppose that for some φ C R F ( p ) either S φ ( M , α ) H ( M , α ) or H ( M , α ) S φ ( M , α ) , without loss of generality suppose the first. Then the formula S φ ( x , α ) ¬ H ( x , α ) defines a bounded subset of q ( M ) . Since α is an arbitrary realization of p, then p   q       a   .
(b) Now assume that for each φ 1 , φ 2 ( C R F ( p ) C L F ( p ) ) , S φ 2 ( M , α ) = S φ 1 ( M , α ) = H ( M , α ) . Denote E ( y 1 , y 2 ) : = x ( H ( x , y 1 ) H ( x , y 2 ) ) . Since the theory T is weakly o-minimal, E ( M , α ) = 1 i n E i ( M , α ) for some n < ω and some ( A { α } ) -definable sets E i ( M , α ) . Let I : = { i n | E i ( M , α ) V p ( α ) } . Denote E ( x , α ) : = i I E i ( x , α ) . Then, by the assumption in the beginning of this paragraph, V p ( α ) ( E ( M , α ) ) c . By monotonicity, γ 1 < ( E ( M , α ) ) c < γ 2 for some realizations γ 1 , γ 2 of p. Then we obtain a contradiction since no such definable set can be greater than V p ( α ) .
Next, we prove that the type q is social. Without loss of generality let H guarantee that p   q       a   . By Note 1 q   p       a   . Let H 0 be a convex formula guaranteeing q   p       a   . Fix realizations α and β of these types such that β H ( M , α ) and α H 0 ( β , M ) . Towards a contradiction suppose that the type q is not social. Let E q ( x , y ) be an A-definable equivalence relation generated by the greatest convex to the right formula on q. Then E q ( M , β ) is a convex proper subset of q ( M ) bounded above and below by some realizations of q. Next in the proof, starting from E q ( M , β ) , we will successively apply certain formulas forming new definable sets over ( A { β } ) to obtain a contradiction.
Denote H 0 ( β , y ) : = x E q ( x , β ) H 0 ( x , y ) . Then H 0 ( β , M ) = β E q ( M , β ) H 0 ( β , M ) p ( M ) is a bounded subset of p ( M ) . Note that α H 0 ( β , M ) H 0 ( β , M ) .
Let ε be the equivalence relation on p ( M ) generated by some convex to the right on p formula φ . Denote ε ( x , β ) : = y H 0 ( β , y ) ε ( x , y ) . Then ε ( M , β ) = α H 0 ( β , M ) ε ( M , α ) p ( M ) is a bounded subset of p ( M ) . Note that, since the type p is social, there is an infinite number of distinct convex to the right formulas on p. If φ 1 , φ 2 C R F ( p ) are such that φ 2 is strictly greater than φ 1 , and ε φ 1 ε φ 2 be the equivalence relations on p generated by φ 1 and φ 2 , then ε φ 1 ( M , α ) ε φ 2 ( M , α ) , and therefore ε φ 1 ( M , β ) ε φ 2 ( M , β ) . Because α H 0 ( β , M ) , for each γ V p ( α ) there is ψ C R F ( p ) such that γ ε ψ ( M , β ) . The same also holds for each ψ C R F ( p ) greater than ψ . We have
V p ( α ) φ C R F ( p ) ε φ ( M , β ) .
For each equivalence relation ε generated by a convex to the right formula on p denote H ε ( β , y ) : = x ε ( x , β ) H ( x , y ) . Then H ε ( β , M ) = α ε ( M , β ) H ( α , M ) q ( M ) is a bounded subset of q ( M ) . Moreover, E q ( M , β ) H ε ( β , M ) . But since E q is the maximal convex to the right equivalence relation on q, E q ( M , β ) = H ε ( β , M ) for each ε . Then E q ( M , β ) = φ C R F ( p ) H ε φ ( β , M ) .
Denote S ( y , α ) : = x H ( x , α ) x H ( x , y ) E q ( x , x ) . Then
V p ( α ) φ C R F ( p ) ε φ ( M , β ) S ( M , α ) .
From the definition it follows that V p ( α ) cannot be a proper subset of any ( A { α } ) -definable bounded in p ( M ) set. Nor can it be equal to any such set, since p is social and V p ( α ) is not ( A { α } ) -definable. Thus, we have obtained a contradiction and the theorem is proved. □
Corollary 7.
Let T be a weakly o-minimal theory, let p , q S 1 ( A ) for some subset A of an | A | + -saturated model M T . Then if p a q and p   q       w   , then the type p is quasisolitary and the depth of the convex formula guaranteeing p   q       w   on some formula from p ( M ) is equal to 1.
Proof of Corollary 7.
First part of the corollary follows directly from Theorem 8, 2.
Let p , q S 1 ( A ) be two non-isolated 1-types such that p a q , p   q       w   . Let H ( x , y ) be a 2-A-formula such that for any α p ( M ) , H ( M , α ) q ( M ) and ¬ H ( M , α ) q ( M ) .
If the depth of H is equal to zero, then H should be constant on p ( M ) , which is impossible. Next we show that the depth of H on the 1-type p cannot exceed 1.
By Proposition 2, the depth of H on some convex formula Θ p is equal to k. Towards a contradiction suppose that k is at least 2. Then there are distinct equivalence relations E 1 ( x , y ) and E 2 ( x , y ) as in the definition of the depth of a formula. Denote H 2 ( x , α ) : = z ( E 2 ( z , α ) H ( x , z ) ) and H 1 ( x , α ) : = z ( E 1 ( z , α ) H ( x , z ) ) . Then we can derive the formula H 2 ( x , α ) ¬ H 1 ( x , α ) which has a non-empty intersection with q ( M ) . There are two elements γ 1 , γ 2 q ( M ) such that M H 1 ( γ 1 , α ) ¬ H 2 ( γ 2 , α ) . Thus, γ 1 < ¬ H 1 ( M , α ) H 2 ( M , α ) < γ 2 . This means that p   q ,     a   which is a contradiction. □
Theorem 9.
Let T be a weakly o-minimal theory having less than 2 0 countable models. Let each type p over a finite set be non-social (equivalently, quasisolitary). Let Γ be an infinite set of pairwise non-weakly orthogonal and almost orthogonal non-isolated types over some finite subset A of an | A | + -saturated model M T . Then 0 I ( T , 0 ) < 2 0 .
Proof of Theorem 9.
Until the end of the proof let the theory T be small, since otherwise it has 2 0 countable models.
Let Γ = { p i } i < ω . Without loss of generality, we suppose that all the p i are either irrational or quasirational to the right. For each i < ω , let φ i ( x , y ) be the greatest convex to the left A-formula on p i . Denote ε i ( x , y ) : = φ i ( x , y ) φ i ( y , x ) . Then the formula ε i is a convex equivalence relation of the set of all realizations of p i . Let for all distinct i , j < ω H i , j be the A-formulas from Definition 2 guaranteeing that p i   p j .     w   We can transform each H i , j so that H i , j ( M , α i ) is convex and p j ( M ) H i , j ( M , α i ) for each α i p i ( M ) .
It is impossible for α i p i ( M ) , γ 1 , γ 2 p j ( M ) to be such that γ 1 H i , j ( M , α i ) , γ 2 H i , j ( M , α i ) and at the same time ε j ( γ 2 , γ 1 ) . Indeed, otherwise the set ε j ( M , γ 1 ) H ( M , α i ) p j ( M ) would be ( { α i } A ) -definable by the formula y ( ε j ( x , y ) H i , j ( x , α i ) ¬ H ( y , α i ) ) , which is impossible since p i a p j .
Now fix an arbitrary k < ω and a realization α k of p k , and let M k be the prime model of T over { α k } A . Let p k ( x , α k ) : = p k ( x ) { x < ε k ( x , α k ) } . Suppose there is β k p ( M k , α k ) , that is β k p k ( M k ) such that β k < ε k ( M k , α k ) . Since M k is prime over α k , there is an A-formula ψ ( x , α k ) such that β k ψ ( M k , α k ) p k ( M k , α k ) and ψ ( x , α k ) isolates a type over α k A . Then x ( ψ ( x , α k ) x x α k ) is a convex to the left on p k formula greater than φ k , which is impossible. Then there can be no such β k p k ( M i ) , and p k should be omitted in M k . Then ε i ( M k , α k ) = p k ( M k ) . Next we show that a similar property does not hold for p j ( M k ) .
Towards a contradiction suppose that there are j k and β j p j ( M k ) H k , j ( M k , α k ) . Then t p ( β j / A α k ) is isolated, let μ ( x , α k ) be the A-formula isolating this type. Then μ ( M k , α k ) H k , j ( M k , α k ) p ( M k ) . Note that for any | A | + -saturated model M T with A { α k } M , μ ( M , α i ) H k , j ( M , α k ) p ( M ) . Then the formula μ ( x , y ) guarantees that p k   p j ,     a   which is a contradiction. Therefore, we obtained that p j ( M k ) H k , j ( M k , α k ) = .
(a) If all the p i are irrational, analogically to the previous part, we obtain p j ( M k ) H ( M k , α k ) = for each j k . Then p j ( M k ) = and M k omits every p j , j i . Fix for every i < ω a prime model M i over the set A and an arbitrary realization of p i . Then each M i realizes p i and omits all the p j for j i . Then for distinct i 1 , i 2 < ω , M i 1     M i 2 , and I ( T , 0 ) 0 .
(b) Suppose that all the p i are quasirational to the right. For each i < ω let U i ( x ) be the A-formula from Definition 7 guaranteeing quasirationality of p i .
The ( A { α k } ) -formula ¬ H k , j ( x , α k ) U j ( x ) defines the set p j ( M ) H k , j ( M , α k ) . Since the theory T is small, this formula has an isolated over ( A { α k } ) subformula, which has to be realized in p j ( M k ) . Therefore, p j ( M k ) = p j ( M k ) H ( M k , α k ) .
Thereby, the set p k ( M k ) contains the least ε k -class, namely, ε k ( M k , α k ) , while for each j k , the set p j ( M k ) has no least ε j -class. Since the index k was arbitrary, for each i < ω , we can fix a prime model M i over the set A and some realization of p i with a least ε i -class and no least ε j -class for each j i . Then, T has at least 0 countable models. □

5. Conclusions

The article applied L. Mayer’s approach to a wider range of theories. It considered the case of an infinite number of countable, non-isomorphic models of a small, weakly o-minimal theory with a non-maximal number of countable models. Therefore, in order to solve the problem of the countable spectrum of weakly o-minimal theories, the case of the maximum number of countable models remains to be described.

Author Contributions

Conceptualization, B.B. and T.Z.; methodology, B.B. and T.Z.; validation, B.B., N.T. and T.Z.; formal analysis, B.B., N.T. and T.Z.; writing—original draft preparation, B.B. and T.Z.; writing—review and editing, B.B., N.T. and T.Z.; supervision, B.B.; funding acquisition, B.B. All authors have read and agreed to the published version of the manuscript.

Funding

This research is funded by the Science Committee of the Ministry of Science and Higher Education of the Republic of Kazakhstan (Grant No. AP19677434).

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding authors.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Pillay, A.; Steinhorn, C. Definable Sets in Ordered Structures. I Trans. Am. Math. Soc. 1986, 295, 565–592. [Google Scholar] [CrossRef]
  2. Mayer, L.L. Vaught’s conjecture for o-minimal theories. J. Symb. Log. 1988, 53, 146–159. [Google Scholar] [CrossRef]
  3. Marker, D. Omitting types in o-minimal theories. J. Symb. Log. 1986, 51, 63–74. [Google Scholar] [CrossRef]
  4. Shelah, S. Classification Theory and the Number of Non-isomorphic Models. In Studies in Logic and the Foundations of Mathematics; North-Holland Publishing Company: Amsterdam, The Netherlands, 1990; Volume 92, pp. 34–705. [Google Scholar]
  5. Dickmann, M.A. Elimination of quantifiers for ordered valuation rings. In Proceedings of the 3rd Easter Conference on Model Theory, Gross Koris, Germany, 8–13 April 1985; pp. 64–88. [Google Scholar]
  6. Kulpeshov, B.S.; Sudoplatov, S.V. Vaught’s conjecture for quite o-minimal theories. Ann. Pure Appl. Log. 2017, 168, 129–149. [Google Scholar] [CrossRef]
  7. Alibek, A.; Baizhanov, B.S.; Kulpeshov, B.S.; Zambarnaya, T.S. Vaught’s conjecture for weakly o-minimal theories of convexity rank 1. Ann. Pure Appl. Log. 2018, 169, 1190–1209. [Google Scholar] [CrossRef]
  8. Kulpeshov, B.S. Vaught’s conjecture for weakly o-minimal theories of finite convexity rank. Izv. Math. 2020, 84, 324–347. [Google Scholar] [CrossRef]
  9. Baizhanov, B.; Umbetbayev, O.; Zambarnaya, T. Non-orthogonality of 1-types in theories with a linear order. Bull. Irkutsk. State Univ. Ser. Math. 2025, in press. [Google Scholar] [CrossRef]
  10. Macpherson, D.; Marker, D.; Steinhorn, C. Weakly o-minimal structures and real closed fields. Trans. Am. Math. Soc. 2000, 352, 5435–5483. [Google Scholar] [CrossRef]
  11. Verbovskiy, V. On formula depth of weakly o-minimal structures. In Algebra and Model Theory; Ponomarev, K., Pinus, A., Eds.; NSTU: Novosibirsk, Russia, 1997; pp. 209–224. [Google Scholar]
  12. Baizhanov, B.S. Orthogonality of one-types in weakly o-minimal theories. In Algebra and Model Theory 2: Collection of Papers; Pinus, A.G., Ponomaryov, K.N., Eds.; NSTU: Novosibirsk, Russia, 1999; pp. 5–28. [Google Scholar]
  13. Baizhanov, B.S.; Tazabekova, N.S. Essential kinds of 1-types over sets of models of weakly o-minimal theories. Kazakh Math. J. 2023, 23, 6–27. [Google Scholar] [CrossRef]
  14. Alibek, A.; Baizhanov, B.S. Examples of countable models of weakly o-minimal theory. Int. J. Math. Phys. 2012, 3, 1–8. [Google Scholar]
  15. Tanović, P. Vaught’s Conjecture for Theories of Discretely Ordered Structures. Notre Dame J. Form. Log. 2024, 65, 25–35. [Google Scholar] [CrossRef]
  16. Alibek, A.A.; Baizhanov, B.S.; Zambarnaya, T.S. Discrete order on a definable set and the number of models. Math. J. 2014, 14, 5–13. [Google Scholar]
  17. Baizhanov, B.S.; Verbovskii, V.V. O-Stable Theories. Algebra Log. 2011, 50, 211–225. [Google Scholar] [CrossRef]
  18. Baizhanov, B.; Zambarnaya, T. Constructing models of small ordered theories with maximal countable spectrum. arXiv 2021, arXiv:2109.14877. [Google Scholar] [CrossRef]
  19. Baizhanov, B.; Umbetbayev, O.; Zambarnaya, T. Non-existence of uniformly definable family of convex equivalence relations in an 1-type of small ordered theories and maximal number of models. Kazakh Math. J. 2019, 19, 98–106. [Google Scholar]
  20. Verbovskiy, V. On the function depth in an o-stable ordered group of a finite convexity rank. Kazakh Math. J. 2025, 25, 25–35. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Baizhanov, B.; Tazabekova, N.; Zambarnaya, T. On One Laura Mayer’s Theorem. Symmetry 2025, 17, 1641. https://doi.org/10.3390/sym17101641

AMA Style

Baizhanov B, Tazabekova N, Zambarnaya T. On One Laura Mayer’s Theorem. Symmetry. 2025; 17(10):1641. https://doi.org/10.3390/sym17101641

Chicago/Turabian Style

Baizhanov, Bektur, Nargiza Tazabekova, and Tatyana Zambarnaya. 2025. "On One Laura Mayer’s Theorem" Symmetry 17, no. 10: 1641. https://doi.org/10.3390/sym17101641

APA Style

Baizhanov, B., Tazabekova, N., & Zambarnaya, T. (2025). On One Laura Mayer’s Theorem. Symmetry, 17(10), 1641. https://doi.org/10.3390/sym17101641

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Article metric data becomes available approximately 24 hours after publication online.
Back to TopTop