2. Preliminaries
Let
be a linearly ordered structure. Although most of the results hold for the general case, we assume the structure
is densely ordered [
15,
16].
For subsets A and B of M, we use the following notations:
We write
if for all
,
,
. We write
(
) if
(
). If sets
A and
B are
C-definable (
), then
and
are
C-definable as well.
Definition 4. A subset A of a linearly ordered structure is said to be convex if implies for all and all .
Definition 5. A formula is a convex formula, if for every the set is convex in every model of containing and .
In general, if a formula defines a convex set when any assignment is given to all the variables but , we say that is convex in .
Definition 6 ([
17]).
(1) The convex closure of a formula is the following formula:.
(2) The convex closure of a type is the following type:
.
Similarly, denote . We define , and . Note that the type is not complete, and has a unique completion to a type from if and only if . We call the type 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, , or, equivalently, .
Each convex type is of one of the following kinds.
Definition 7. Let T be a linearly ordered theory, and be a convex 1-type, where A is a subset of an -saturated model .
(1) The type is isolated if there exists a convex formula , , such that .
(2) The type is quasirational to the right (left) if there exists a convex formula , , such that for each and each ()
if and only if .
(3) The type is irrational if it is neither isolated nor quasirational.
Definition 8 ([
9]).
Let . We say that is not weakly convex-orthogonal to , , if there exists a convex formula , , such that and for all (equivalently, for some) . Definition 9. Let , . We say that the family Γ is not weakly convex orthogonal if there is an A-formula () such that there exists such that is convex in and for some ,
and .
Then, the family is weakly convex orthogonal if and only if for each and each , where for all ,
for all .
Definition 10. Let , be an A-formula, and be an (parametrically definable) equivalence relation with convex classes.
(1) The formula monotonically increases (decreases) on B, if for all , with , the following holds:
and for some distinct , . (2) The formula monotonically increases (decreases) on , if for all , with and , the following holds:
and for some distinct , and . Let be an A-formula, be arbitrary and distinct, and be an -tuple. Then, we let be the result of the substitution of for all the parameters of H but and . More precisely, if, without loss of generality, , and , then define
Then,
is an
-definable 2-formula.
Definition 11. (1) An A-formula monotonically increases (decreases) in with respect to () on , if the formula monotonically increases (decreases) on for all assignments , , .
(2) An A-formula monotonically increases (decreases) on equivalence classes in with respect to () on , if the formula monotonically increases (decreases) on for some equivalence relation and all assignments , , .
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 and each non-weakly convex orthogonal family of non-isolated convex types such that each proper subset is weakly convex orthogonal, where is finite, and is -saturated, there exists an A-definable formula as in Definition 9 such that is convex in and strictly monotonic in with respect to on , , , for each distinct .
(2) The theory T has monotonic non-orthogonality on equivalence classes if for each and each finite non-weakly convex orthogonal family of non-isolated convex types such that each proper subset is weakly convex orthogonal, where is finite, and is -saturated, there exists an A-definable formula as in Definition 9 such that it is convex in and is strictly monotonic on equivalence classes in with respect to on , , , for each with .
Each theory with monotonic non-orthogonality has monotonic non-orthogonality on equivalence classes by the trivial equivalence relation . 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 and H are as in Definition 8, and H monotonically increases (decreases) on , denote . Then, the formula is constant on each , , and monotonically increases (decreases) on . Analogically, the formula can be taken for a formula H from Definition 9 which is monotonic on equivalence classes in with respect to on , , , , where 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 , where < is the standard dense linear order without endpoints, P is a unary predicate and U is a binary predicate. Let for all natural , , , and . Define if and only if and .
Define , and . The types p and q are convex, and are the only two distinct non-isolated types over the empty set, and . There are no other distinct non-isolated types over finite sets. Then, the formula monotonically increases on for each . Therefore, has monotonic non-orthogonality.
Example 2. Let be such that for each . For each denote .
Let , where , and S are unary predicates and U is a binary predicate. Let , , , , and . Let < be the standard relation of linear order on , and the lexicographic order on . That is, for each , let if and only if on either , or and .
Analogically to the previous example, let for all natural , , , and .
Let , and for all , let if and only if .
For , define . All the are the complete non-isolated mutually dense types. Moreover, for each and each distinct and , , and this convex closure is equal to the set of all realizations of the incomplete type in . Let . Then, , and for each and .
Let . Then, E is an ∅-definable equivalence relation with convex classes on . Then, if and only if . Then, the formula U is monotonic on and strictly monotonic on equivalence classes on . Therefore, this is an example of a theory with monotonic non-orthogonality on equivalence classes but 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, , be -saturated, and be non-isolated types. Then, if and only if . Corollary 1. Let T be a countable linearly ordered theory with monotonic non-orthogonality on equivalence classes, , be -saturated, and be non-isolated types. Then, if and only if .
Corollary 2. Let T be a countable linearly ordered theory with monotonic non-orthogonality on equivalence classes, , be -saturated. Then, is an equivalence relation on .
Proof of Corollary 2. As noted above, without loss of generality, assume that T has monotonic non-orthogonality.
From the definition it follows that for each . Theorem 2 proves symmetry.
Let be such that and . Let and be convex A-formulas guaranteeing these two non-weak orthogonalities, respectively. We can transform these formulas so that for all , , , , and the sets , , and are all non-empty.
By compactness, there is a formula such that the formula is a convex monotonic formula on splitting and with for each . Then, the formula guarantees that , thus proving transitivity. □
3. Theories with Monotonic Non-Orthogonality
Theorem 3. Let T be a countable theory, , A be a finite subset of a countably saturated model . If p is non-isolated, then there exists a countable family of 1-A-formulas such that and for all .
Proof of Theorem 3. Let be an enumeration of all formulas of p. Denote . Let be the smallest index such that . Such a formula exists since the type p is non-isolated. Denote . Continuing this construction by induction, we obtain a countable family of nested formulas. By construction, .
Note that for each there is such that . This is true because on step i either is chosen as , or a smaller formula has already been chosen before, that is, .
Towards a contradiction, suppose that there is . Then, there is such that . For some , . Then, there is such that . This is a contradiction with the choice of c. Therefore, . □
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, , A be a finite subset of a countably saturated model . If is non-isolated, then there exists a countable family of convex 1-A-formulas such that and for all .
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 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 . If is such that is not weakly convex orthogonal, then there is such that .
The proof is by induction on . The case when is trivial.
Let . For induction, assume that the claim holds for all . Let be a weakly orthogonal set of non-isolated 1-types from . Since all are non-isolated, without loss of generality, we can assume that each is non-definable. That is, for each , is either irrational or quasirational to the right.
Let be an A-definable formula such that for some , , …, , the set is convex, there are , , and . Let for each i, , be such that is monotonic in z on with respect to each , , without loss of generality, let H be strictly increasing in z for each i.
Let be such convex A-formulas that , . Without loss of generality, let . Such two formulas exist because of Corollary 3. For each , denote
Monotonicity of
H implies
. Let
be the sequence of convex formulas defining
as in Corollary 3. Denote
While
j approaches infinity,
approaches
. Monotonicity and compactness imply the existence of
such that
.
Denote . Then, . The pairs of formulas and behave analogically to the pair . Then, we can apply the previous consideration to construct two convex formulas and such that .
For each , and later, for each finite sequence of zeroes and ones, denote . Then, .
Using the new pairs of formulas, we can continue dividing the definable sets: produce , produce , produce , and produce .
Repeating this construction, for each finite sequence of zeroes and ones we obtain a convex formula such that . This gives us a continuum of 1-types over , which contradicts the theory being small. □
Theorem 5 ([
18]).
Let be a model of a small countable complete theory T. Let be countable. Then, there exists a countable model such that and for every there is , such that 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 for a finite set A. Then, .
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 countable non-isomorphic models. Extend the language of T to , where L is the language of T, and work in the theory , where is some enumeration of the set A. Let be an -saturated elementary extension of .
Fix an arbitrary enumeration . Let , , be an arbitrary infinite sequence of zeroes and ones. Denote . Since , for each , we can choose a special set of representatives of realizations of ’s such that for each . Let be the model which exists by Theorem 5 applied to the set .
Let be such that . We claim that . Towards a contradiction suppose that there is . Then, by Theorem 5, there is a tuple such that is isolated. Let be the isolating formula of . Then, . We have that . Since the type is non-isolated, . Then, we obtain .
By construction of , for some distinct , where . Then, 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, . Because is arbitrary, realizes all with , and omits all with . Therefore, for different infinite sequences and of zeroes and ones, the models and are non-isomorphic. This leads to continuum countable non-isomorphic models of the theory , as well as of the theory T. □
4. Weakly O-Minimal Theories
Let be an -saturated model of a weakly o-minimal theory T for .
Definition 13 ([
12]).
(1) An A-definable formula is said to be p–preserving (p-stable) if there exist α, , such that and .(2) A p-preserving formula is said to be convex to the right (left) on p if there exists α∈ such that is convex in the set (that is, , and imply ), α is the left (right) endpoint of the set , and .
The family of all
p-preserving convex to the right (left)
A-formulas is denoted by
(
). 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 is quasisolitary if there exists a greatest convex to the right (equivalently, convex to the left) on p formula.(2) A type 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, , if there exists an A-definable formula , such that for some and , and . Note 1 ([
12]).
Let T be a weakly o-minimal theory, let A be a subset of an -saturated model . Then, the relations and are equivalence relations on . Recall that in weakly o-minimal theories, the set of all realizations of each complete 1-type is convex. Then, for such theories if and only if . Hence, we do not need to distinguish 1-types from their convex closures.
Proposition 1. Let T be a weakly o-minimal theory, , and be -saturated. Let 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 that satisfies Definition 9 such that for all , the formula is convex in and for all ,
Proof of Proposition 1. Non-weak orthogonality of implies that there are an n-A-formula and realizations such that and for some i, , and some we have . Then for any arbitrary (), there exists such that . Let us prove this.
Denote , , , and let . Since and are orthogonal families of 1-types, then and . Since and , we have that .
By Note 1 the relation of non-weak orthogonality is symmetric, therefore, and there exits such that .
Denote . To simplify the notation, until the end of this proof, we move the free variable of H forward. Denote . Note that the free variable in the new notation can correspond to realizations of different ’s depending on i.
We construct an n-A-formula such that and for each i () the following holds: , , and either or .
We define by induction on . Consider , where are all the convex parts of . Denote by the convex part of such that .
, if . Here, .
, if . Here, .
, if . Here, .
, if . Here, .
It follows from the definition of that .
Suppose that . Denote and for any . Since realizes a weakly orthogonal subset of , then implies the existence of such that . For the case , the formula satisfies for convenient , . Now define for :
if , let ;
if , let .
For each (), let .
Denote . Following the definition for each i (), we have and either or . □
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
to be defining a convex set starting from negative infinity as a representation of the right border of
.
Let T be a weakly o-minimal theory, A be a finite and I be an infinite subset of an -saturated model . Let be a convex A-formula such that for each , .
Definition 16 ([
10]).
The formula is tidy on I if one of the following holds:(1) The formula H is locally increasing on I, that is, for each there is an interval such that and H strictly increases on J;
(2) The formula H is locally decreasing on I, that is, for each there is an interval such that and H strictly decreases on J;
(3) The formula H is locally constant on I, that is, for each there is an interval such that and H is constant on J.
Let be a convex A-formula such that for each , . Denote
The formula
means that there is an interval around
y on which
H is constant. Analogically,
and
mean that on some interval around
y the formula
H increases or decreases, respectively. Thus,
[
10]. Since the theory
T is weakly o-minimal, each
is a finite union of convex sets and
X is a finite set. Thus, for any
,
.
Below we study the behavior of the formula H on the convex formula and give the definition of the depth of H on .
Let
These three relations indicate pairs of elements, on the intervals between which the formula
H is constant (
), strictly increases (
), or strictly decreases (
). From the definitions it follows that for each
,
. For each
, the sets
,
,
are maximal convex sets containing
a, on which
H is constant, strictly increases or strictly decreases, respectively. Next, we look at
, where
, and
a belongs to the convex part
of
.
We consider the following three cases.
. Let
be an arbitrary convex part of the formula
. If for some
, we have
, then in this case we say, that the depth of the formula
on
is equal to zero. If the set of all
-classes is finite, then because each
-class is
A-definable, the
depth of the
A-formula
on each
-class is equal to zero. If the set of all
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
is at least 1. Notice that then the formula
can be refined to
A-formulas
and
in the following way.
We say that if and there is an interval around on which H increases up to . And let be the maximal convex set containing on which H increases up to . That is, if and , then and for each with .
We say that if and there is an interval around on which H decreases up to . And let be the maximal convex set containing on which H decreases up to . That is, if and , then and for each with .
. Let be a convex part of the formula . If for some , , we say that the depth of the formula H on is equal to 1.
If , , are representatives of distinct -classes such that , then denote . Since there is only a finite number of -classes, each of them is A-definable. Then for each k, the depth of H on is equal to 1.
If the set of
-classes is infinite, then the linear ordering on these classes is dense and the
depth of the formula
is greater than or equal to 2. Consider two elements
such that
and
. Suppose
. If for each
,
implies
, then
, what contradicts the initial condition. So, there is
such that
and
. Assume that for each
there exist
such that
,
. and
. Then the formula
has an infinite number of elements
which satisfy it and alternate with the elements from the set
. This contradicts the definition of a weakly o-minimal theory. Thus
Introduce a new formula
. This formula is locally constant on
. From (
1) it follows that
is decreasing on
. Consider the formula
. This formula is a relation of equivalence
and each
-class contains an infinite number of
-classes. If
for some
, then we say that the depth of
H on
is equal to 2.
If there exists a finite number of elements from different -classes such that , then denote for each . Since the number of -classes is finite, each of these classes is definable. Then for each k, the depth of H on is equal to 2.
If the set of classes is infinite, then the linear ordering on these classes is dense and the depth of the formula is greater than or equal to 3.
. This case is analogical to the case
, instead of decreasing increasing classes we have increasing decreasing classes from the same consideration based on the next condition (
2):
Each
-class consists of
-classes such that the formula
H decreases on
and increases on representatives of distinct
-classes of elements from
.
Let . Consider the three next formulas:
;
;
.
Since the theory is weakly o-minimal, in the case
, each of these formulas has a finite number of convex parts. This number determines the depth of the formula
H on
[
11]. Thus, there is only a finite number of equivalence relations
with convex classes on
such that for each
k (
), each
-class contains an infinite number of
-classes, the number of
-classes is finite, and for each
is some
, where
and
(
) implies
(
) for all
.
Then there exists a finite number of elements from different -classes such that . Thus, denote . Since there is a finite number of -classes, each of these classes is definable. Then for each s () the depth of H on is equal to n.
The formula is strictly monotonic on . This means if are such that , then implies , and implies .
Thus, taking into consideration the definition of the depth of the 2-formula H, we obtain the following.
Proposition 2. Let be two non-isolated 1-types over A, and H be a 2-A-formula such that for each , we have , , and . Then there exists k (), where n is the depth of H on the corresponding , such that is strictly monotonic on for some convex formula , which is a subformula of some -class, and for each , .
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 if and , then ;
(2) The formula is tidy on , where ;
(3) For each has no minimum and no maximum;
(4) ;
Where is an equivalence relation on I such that for each if and only if either , or implies that is strictly monotonic, or implies that is strictly monotonic. And 0-tidy is tidy, , and .
Definition 18 ([
11]).
If H and I are as in Definition 16, the formula H is strongly tidy on I if there exists such that H is -tidy on I and is strictly monotonic on . 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 is said to have strong monotonicity [11] (monotonicity [10]) if for each convex formula with , there is and a partition of into definable sets such that X is finite, each is convex, and the formula is strongly tidy (tidy) on each . Definition 20 ([
11]).
Let be a weakly o-minimal structure. Then has finite depth, if for each convex formula with there is such that for each and each convex set on which is strongly tidy, the depth of on I is less than n. Theorem 6 ([
10]).
If all models of are weakly o-minimal, then has monotonicity. Theorem 7 ([
11]).
If all models of are weakly o-minimal, then 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 be finite, be -saturated, , and be a non-weakly orthogonal family of non-isolated types from 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 from Proposition 1. Then for all , the formula is convex in and for all ,
By Proposition 2, for the formula , there exists an -formula and an -definable equivalence relation such that is strictly monotonic on . Notice that since , we have that . Then is strictly monotonic on for each .
The same holds when an arbitrary pair , 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 .
Corollary 6. Let T be a weakly o-minimal theory having less than models. Then there is no infinite family of pairwise weakly orthogonal 1-types over a finite set.
Definition 21. ([
12])
Let , such that is -saturated. Then a neighborhood of the set B in the type p is the following set: there exist and a formula , such that .
Let then .
Note that for each , . Indeed, if is an -definable formula as in the definition, then, if non-empty, is a p-preserving convex to the right formula, and is a p-preserving convex to the left formula.
Note 2 ([
12]).
Let . Then p is almost orthogonal to q (denoted ) if and only if for some (equivalently, for every) , . 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 for some subset A of an -saturated model . Then if and p is social, then and q is social.
Proof of Theorem 8. Let and p be social. Then there is a convex A-formula such that for each the sets and are non-empty, , or, equivalently, .
For each , denote . Fix arbitrary .
(a) Suppose that for some either or , without loss of generality suppose the first. Then the formula defines a bounded subset of . Since is an arbitrary realization of p, then .
(b) Now assume that for each , . Denote . Since the theory T is weakly o-minimal, for some and some -definable sets . Let . Denote . Then, by the assumption in the beginning of this paragraph, . By monotonicity, for some realizations of p. Then we obtain a contradiction since no such definable set can be greater than .
Next, we prove that the type q is social. Without loss of generality let H guarantee that . By Note 1 . Let be a convex formula guaranteeing . Fix realizations and of these types such that and . Towards a contradiction suppose that the type q is not social. Let be an A-definable equivalence relation generated by the greatest convex to the right formula on q. Then is a convex proper subset of bounded above and below by some realizations of q. Next in the proof, starting from , we will successively apply certain formulas forming new definable sets over to obtain a contradiction.
Denote . Then is a bounded subset of . Note that .
Let
be the equivalence relation on
generated by some convex to the right on
p formula
. Denote
. Then
is a bounded subset of
. Note that, since the type
p is social, there is an infinite number of distinct convex to the right formulas on
p. If
are such that
is strictly greater than
, and
be the equivalence relations on
p generated by
and
, then
, and therefore
. Because
, for each
there is
such that
. The same also holds for each
greater than
. We have
For each equivalence relation generated by a convex to the right formula on p denote . Then is a bounded subset of . Moreover, . But since is the maximal convex to the right equivalence relation on q, for each . Then .
Denote . Then
From the definition it follows that
cannot be a proper subset of any
-definable bounded in
set. Nor can it be equal to any such set, since
p is social and
is not
-definable. Thus, we have obtained a contradiction and the theorem is proved. □
Corollary 7. Let T be a weakly o-minimal theory, let for some subset A of an -saturated model . Then if and , then the type p is quasisolitary and the depth of the convex formula guaranteeing on some formula from is equal to 1.
Proof of Corollary 7. First part of the corollary follows directly from Theorem 8, 2.
Let be two non-isolated 1-types such that , . Let be a 2-A-formula such that for any , and .
If the depth of H is equal to zero, then H should be constant on , 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 is equal to k. Towards a contradiction suppose that k is at least 2. Then there are distinct equivalence relations and as in the definition of the depth of a formula. Denote and . Then we can derive the formula which has a non-empty intersection with . There are two elements such that . Thus, . This means that which is a contradiction. □
Theorem 9. Let T be a weakly o-minimal theory having less than 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 -saturated model . Then .
Proof of Theorem 9. Until the end of the proof let the theory T be small, since otherwise it has countable models.
Let . Without loss of generality, we suppose that all the are either irrational or quasirational to the right. For each , let be the greatest convex to the left A-formula on . Denote . Then the formula is a convex equivalence relation of the set of all realizations of . Let for all distinct be the A-formulas from Definition 2 guaranteeing that We can transform each so that is convex and for each .
It is impossible for to be such that , and at the same time . Indeed, otherwise the set would be -definable by the formula , which is impossible since .
Now fix an arbitrary and a realization of , and let be the prime model of T over . Let . Suppose there is , that is such that . Since is prime over , there is an A-formula such that and isolates a type over . Then is a convex to the left on formula greater than , which is impossible. Then there can be no such , and should be omitted in . Then . Next we show that a similar property does not hold for .
Towards a contradiction suppose that there are and . Then is isolated, let be the A-formula isolating this type. Then . Note that for any -saturated model with , . Then the formula guarantees that which is a contradiction. Therefore, we obtained that .
(a) If all the are irrational, analogically to the previous part, we obtain for each . Then and omits every , . Fix for every a prime model over the set A and an arbitrary realization of . Then each realizes and omits all the for . Then for distinct , , and .
(b) Suppose that all the are quasirational to the right. For each let be the A-formula from Definition 7 guaranteeing quasirationality of .
The -formula defines the set . Since the theory T is small, this formula has an isolated over subformula, which has to be realized in . Therefore, .
Thereby, the set contains the least -class, namely, , while for each , the set has no least -class. Since the index k was arbitrary, for each , we can fix a prime model over the set A and some realization of with a least -class and no least -class for each . Then, T has at least countable models. □