1. Introduction
This work belongs to the field of Model Theory, one of the dynamically developing branches of Mathematical Logic. Contemporary topics from this discipline have many intersections with the modern questions that originate from the tasks of the following areas: Abstract Algebra, Universal Algebra, Algebraic Geometry, and topology. Model Theory studies formal languages and their interpretations, or models, with a focus on the interplay between syntactic and semantic structures.
Historically, Model Theory has evolved along two distinct trajectories, often referred to as the “western” and “eastern” schools. This division is rooted in the geographical locations of its pioneers: Alfred Tarski, who resided on the West Coast of the United States, and Abraham Robinson, who was based on the East Coast. The western approach emphasizes problems in Mathematical Analysis and Algebraic Geometry, typically assuming the completeness of the formal languages under consideration. In contrast, the eastern approach is grounded in Universal Algebra and Abstract Algebra, often dealing with incomplete theories and their applications. This research aligns with the Eastern tradition, focusing on the study of incomplete theories, particularly the class of Jonsson theories.
Jonsson theories form a specific subclass of inductive theories, characterized by three key model-theoretic properties: the existence of infinite models, the amalgamation property, and the joint embedding property. According to the definition, Jonsson theories are generally not complete, making their study both more challenging and more general. The absence of elementary equivalence between models of incomplete theories introduces significant complexity, which is why the class of inductive theories—and Jonsson theories in particular—has become a central object of study. Examples of Jonsson theories include the theory of all groups, the theory of abelian groups, the theory of fields of fixed characteristic, the theory of linear orders, and many others. While these are typically incomplete, there are also complete Jonsson theories, such as the theory of divisible abelian groups, the theory of algebraically closed fields of fixed characteristic, and the theory of dense linear orders without endpoints. This duality makes the class of Jonsson theories both versatile and rich in structure, offering a fertile ground for model-theoretic research.
Contemporary research on Jonsson theories has been significantly advanced by the Karaganda School of Model Theory, with key contributions by T.G. Mustafin. Later on, his scientific research in the field of Jonsson theories was continued by representatives of the Karaganda School of Model Theory. The main results concerning Jonsson theories, including those established by the authors mentioned above, as well as the contributions of this work, are detailed in
Section 1 of this paper.
In recent years, members of the Karaganda School of Model Theory have developed a specialized theoretical framework for studying Jonsson theories. This framework incorporates techniques rooted in the theory of companions, originally introduced by A. Robinson. One such technique is the semantic method, first proposed by T.G. Mustafin. The semantic method focuses on analyzing a Jonsson theory by studying its semantic model, which is an -universal and -homogeneous model of the theory. Since the same structure can serve as a semantic model for multiple Jonsson theories in a given language, this method allows us to describe entire classes of Jonsson theories that have the same semantic model. Moreover, this approach enables the study of algebraic structures through their theories in a fixed countable first-order language L.
The semantic model of a Jonsson theory T serves as the primary semantic invariant for a class of cosemantic Jonsson theories. To study the syntactic properties of this model, we consider its elementary theory, which is called the center of the given theory T. To understand the semantic properties of , we examine special definable subsets of the model, such as Jonsson sets and almost Jonsson sets. The study of these subsets involves a closure operator that induces a topology on the model. Common examples of such operators include the definable closure operator and the algebraic closure operator , where X is a Jonsson or almost Jonsson set. For example, considering the theory of fields of the fixed characteristic , which is a Jonsson theory, and the theory of algebraically closed fields of the same characteristic, which is the center of , it is well-known that . In this paper, we do not focus on topological properties of the definable sets but deal with the models that are the closures of almost Jonsson sets, regarding some given pregeometry with some abstract closure operator . Jonsson sets and their generalization—almost Jonsson sets—act as a kind of “basis” for studying the semantic properties of the model, and their closures form a special subclass of Jonsson theories. Specifically, the closure of a Jonsson set is an existentially closed model of the theory, while the class of closures of almost Jonsson sets relates to the Kaiser class of the Jonsson theory. More precisely, the Kaiser class of the Jonsson theory T, which consists of all models of T whose Kaiser hull is a Jonsson theory. The Kaiser class of a Jonsson theory T is proposed as a new, more sophisticated semantic invariant of the Jonsson theory, becoming a carrier of the most essential Jonsson properties of the class of models of T.
The problem of describing and, in particular, axiomatizing the class of existentially closed models of a theory has long been an open and challenging question in Model Theory. Similarly, the axiomatization of the Kaiser class of a Jonsson theory becomes a difficult problem. Solving this problem would significantly enhance our ability to describe the syntactic and semantic properties of Jonsson theories. It is known that the classes of existentially closed models of cosemantic Jonsson theories coincide. In this work, we focus on a narrower class of Jonsson theories whose Kaiser classes coincide. We describe the key properties of the Kaiser class and use this concept to formulate necessary and/or sufficient conditions for characterizing special subclasses of Jonsson theories, such as perfect and
-normal Jonsson theories.
Section 2 of this paper is dedicated to these results, including the problem of axiomatization of the Kaiser class.
In addition, this work extends the technical framework of the semantic method by studying the algebraic properties of classes of theories that have the same semantic model—that is, cosemantic Jonsson theories. The problem of algebraizing theories is a central concern in modern Model Theory, Mathematical Logic, and Universal Algebra. Key works in this direction [
1,
2,
3,
4,
5] have explored the closure of classes of
L-sentences under certain algebraic properties, such as closure under direct products, Horn conditions, and operations defined between theories. However, these results primarily concern complete theories. The novelty of our research lies in applying methods from lattice theory to Jonsson theories, which, as mentioned earlier, are generally incomplete. In this context, we introduce the concept of the Kaiser class
of a theory
T and
-equivalence of theories as new key tools in the framework of Jonsson Model Theory.
Section 3 of this paper describes the lattice of cosemantic Jonsson theories and its special sublattices. These results extend our earlier work [
6], where we introduced certain algebraic structures defined on the class of Jonsson theories.
Let us suggest that our current work is not merely a novelty in terms of introducing new notions; rather, we propose that the concepts of -normality and -equivalence offer a new method and perspective within the classical framework for studying incomplete inductive theories, such as Jonsson theories.
A single observation suffices to illustrate the significance of this approach: numerous unresolved problems persist concerning the axiomatizability of concrete properties of fixed classes of models for such theories. Consequently, a variety of related issues naturally arise—among them, the existence and classification of various types of companions, as well as their connections to long-standing open questions in classical Model Theory. More specifically, the present study is devoted to a foundational analysis of the model-theoretic properties of the Kaiser class of a Jonsson theory, including the theory of groups. In our future work, we aim to determine which subclasses of the Kaiser class of the theory of groups correspond exactly to the class of simple groups.
One such problem is linked to the still unproven Zilber–Cherlin conjecture. A particular task associated with this conjecture concerns the well-known hypothesis that existentially closed groups are simple. However, the class of existentially closed models of the theory of all groups is, in fact, a subclass of the Kaiser class of that theory. In our view, the notion of -normality is a potentially crucial tool in approaching this problem.
This paper is organized as follows: an introduction, three main sections, and a bibliography. Below, we outline the conventions and notation used throughout the text.
We work in a countable first-order language L. By an L-theory T, we mean any consistent set of sentences in L closed under logical consequence. In case when some set S of sentences is not closed under logical consequence but we call it a theory, we mean the deduction closure of S. The class of all L-structures that are models of T is denoted by . If , we write to indicate that all sentences of T are true in M. The axioms of T are the set of L-sentences such that for any model M of T, , and vice versa. Two L-theories and are logically equivalent if , and in this case we write . For a class K of L-structures, means that every structure satisfies . By , we mean the set of all universal consequences of the theory T; similarly, is the set of all universal–existential sentences deduced in T. The Kaiser hull of K, denoted by , is the set of all -sentences in L true in every structure of K. We also denote the Kaiser hull of K by . For any two L-structures A and B, we write if , and for any universal L-formula and element , if , then .
2. Basic Facts on Jonsson Theories
In this section, we present the necessary notions and facts concerning Jonsson theories. We start by describing some classical model-theoretic concepts, such as the amalgamation property, the joint embedding property, and the existentially closed model.
We start with the concepts of amalgamation and joint embedding properties. Originally arising from Algebra, the properties of amalgamation (AP) and joint embedding (JEP) have become fundamental in both classical and modern Model Theory. Amalgamation allows the combination of models with a common submodel, preserving certain properties in the larger model, while joint embedding ensures that two models can be embedded into a third model, revealing their interrelationships. Recall the definitions.
Let K be a class of L-structures.
Definition 1 (p. 80, [
7])
. K admits the amalgamation property (AP), if for any models A, , , and isomorphic embeddings , , there are and isomorphic embeddings , , such that . Definition 2 (p. 80, [
7])
. The class K admits the joint embedding property (JEP), if for any models , there exists a model and isomorphic embeddings , . We say that an L-theory admits AP or JEP, if admits AP or JEP, correspondingly.
In Model Theory, these properties are crucial in the study of categorical structures, stability theory, and classification theory, providing key insights into the interactions between models, model completeness, quantifier elimination, and the transfer of properties across models.
Given that we are working within the framework of inductive theories, the study of amalgamation and joint embedding naturally leads to the consideration of existentially closed (e.c.) models. A key result in Model Theory states that for any model A of an inductive theory T, there exists an e.c. model M of T such that A embeds into M. This result is crucial for understanding the structure of models in inductive theories, as e.c. models provide a canonical way to extend any given model within the theory. Let us recall the definition of the existentially closed model.
Definition 3 (p. 97, [
7])
. A model M of a theory T is said to be existentially closed if for every embedding into another model N of T and every existential formula with parameters from M that is satisfiable in N, it is also satisfiable in M. There is also another definition of existentially closed models proposed by H. Simmons, which is equivalent to Definition 3.
Definition 4 ([
8])
. A structure A is called an existentially closed model of T, if and, for any model B of T, In this paper, we use the results of H. Simmons on existentially closed models, and this is why we prefer to follow Definition 4 for the concept of existentially closed model.
We now recall some classical results on existentially closed models, which are essential for the present study. The first one allows us to determine whether a model of a theory T is an e.c. model.
Theorem 1 ([
8])
. If , where and B is an existentially closed model of T, then A is also an existentially closed model of T. We now turn to Jonsson theories, which are the central focus of this study. As it was mentioned in the introduction, these theories are fundamental in the context of Model Theory, particularly within the framework of inductive theories. The following sections address the key properties of Jonsson theories and their relevance to the present research.
Definition 5 (p. 80, [
7])
. A theory T is called a Jonsson theory, if the following conditions hold:- (1)
T has at least one infinite model,
- (2)
T is an inductive theory (or -axiomatizable, which is equivalent),
- (3)
T admits JEP,
- (4)
T admits AP.
The relevance of studying Jonsson theories is demonstrated by a significant collection of classical algebraic examples. These examples show that such algebras can be studied not only through traditional algebraic methods but also within the framework of Jonsson theory. The following examples of Jonsson theories illustrate the applicability of this approach:
Example 1. - (1)
The theory of all groups;
- (2)
The theory of all abelian groups;
- (3)
The theory of all Boolean algebras;
- (4)
The theory of all linear orders;
- (5)
The theory of all fields of characteristic p, where p is zero or a prime number;
- (6)
The theory of ordered fields;
- (7)
The theory of R-modules;
- (8)
The theory of differential fields of characteristic 0;
- (9)
The theory of differentially closed fields of characteristic 0;
- (10)
The theory of differentially perfect fields of characteristic p;
- (11)
The theory of differentially closed fields of characteristic p.
It follows from the definition that Jonsson theories are, in general, not complete. As a result, for a Jonsson theory T, we are not able to compare models in terms of elementary equivalence within the class of all models of T. However, such a comparison is possible within an important subclass—namely, the class of existentially closed models of T. The following classical result due to W. Hodges enables this.
The following result was obtained by W. Hodges.
Theorem 2 ([
9])
. Suppose T is an L-theory, and let T admit JEP. Let A and B be an existentially closed model of T. Then, each -sentence that is true in A is true in B as well. According to the result, any two existentially closed models of T are elementarily equivalent with respect to a restricted fragment of the language—specifically, the fragment consisting of universal–existential sentences. Nonetheless, as will be seen later, this restriction to universal–existential sentences plays an essential role in the description of the Kaiser class of models of the theory T.
The foundation for the study of Jonsson theories was laid by T. G. Mustafin, who initially defined the semantic model of a Jonsson theory under the assumption of an additional axiom on the existence of a strongly inaccessible cardinal. Later, Ye. T. Mustafin reformulated this definition to eliminate the need for this assumption:
Definition 6 (Ye. T. Mustafin [
10])
. A model of a Jonsson theory T is called a semantic model of this theory, if and is -universal -homogeneous model of T. The semantic model plays a central role in the study of a fixed Jonsson theory, as it serves as a distinctive semantic invariant for the theory. This is demonstrated by the following theorem. The emergence of the notion of a semantic model for the study of an arbitrary Jonsson theory is of twofold importance. First, the semantic model serves as a faithful analogue of the monster model in the context of complete theories. Second, the elementary theory of this model—referred to as the center—constitutes a syntactic invariant that reflects the internal content of the given Jonsson theory.
Theorem 3 (Ye. T. Mustafin [
10])
. An inductive theory T is Jonsson if it has a -universal -homogeneous model (which is its semantic model). In addition to its importance for the study of inductive theories, the class of existentially closed models holds a particularly special significance in the context of Jonsson theories, as demonstrated by the following theorem.
Theorem 4 (T. G. Mustafin [
11])
. For any Jonsson theory T, is an existentially closed model of T, i.e., . As mentioned in the introduction, much of Model Theory focuses on complete theories, and, consequently, the tools for studying complete theories are both more extensive and better developed. In the study of Jonsson theories, we occasionally apply the techniques used in the study of complete theories. This is facilitated by the following concept.
Definition 7 (T. G. Mustafin [
11])
. Let T be a Jonsson theory. Then, theory is called a center of T. Note that by this definition, the center of a Jonsson theory is a complete theory, which allows us to transfer the syntactic properties of the center to the Jonsson theory itself, which may, in general, be incomplete. In cases where we apply the companion theory technique, the following fact, derived from Definition 7, proves particularly useful. It establishes a connection between the classes of models of the given Jonsson theory and its center.
Corollary 1 (T. G. Mustafin [
11])
. Let T be a Jonsson theory, be its center. Then, T and are mutually model consistent, that is . Moreover, the following well-known result shows that the class of e.c. models of a Jonsson theory T preserve the Jonsson properties of T when constructing the Kaiser hull of the class of e.c. models of the given Jonsson theory.
Theorem 5 (A. R. Yeshkeyev [
11])
. Let T be a Jonsson theory, and be the class of existentially closed models of T. Then, is a Jonsson theory. Note that by virtue of Theorem 2, Theorem 5 stays true for any subclass , i.e., is also a Jonsson theory.
When studying the properties of Jonsson theory through the description of its semantic model and center, particular subclasses of Jonsson theories emerge. One such subclass is the class of perfect Jonsson theories. We now provide the definition of a perfect Jonsson theory.
Definition 8 ([
10])
. A Jonsson theory T is called perfect, if is -saturated. The examples of perfect Jonsson theory are represented by points 2–5 and 8–10 in Example 1.
In the study of perfect Jonsson theories, the theory of companions is used. Let us recall the definition of a companion.
Definition 9 ([
7])
. Let T be a theory in the language L. An L-theory is called a companion of T, if the following conditions hold:- (1)
;
- (2)
whenever , ;
- (3)
.
A classic example of a companion of a theory is the model companion. Note that the existence of a model companion for an arbitrary theory is not guaranteed, and the problem of a complete description of the theories for which this is possible remains an open question. We now provide the definition of a model companion.
Definition 10 ([
7])
. Let T be a theory in L. A theory is called a model companion of T, if is a companion of T and is a model complete theory. The effectiveness of the technique of companions is clearly demonstrated by the following theorem.
Theorem 6 (A. R. Yeshkeyev [
11])
. Let T be a Jonsson theory. Then, the following conditions are equivalent:- (1)
T is a perfect Jonsson theory;
- (2)
is a model companion of T;
- (3)
.
When describing the properties of a Jonsson theory, we are essentially examining the properties of its semantic model. However, different Jonsson theories may have the same semantic model. Thus, we are not describing a single theory, but an entire class of theories that share a common semantic model. This is the essence of the semantic approach in the study of Jonsson theories. The central concept in this context is the definition of cosemantic Jonsson theories.
Definition 11 (T. G. Mustafin [
11])
. Let and be Jonsson L-theories, and be their semantic models, correspondingly. and are said to be cosemantic (denoted by “”), if . In the study of Jonsson theories, cosemanticness is primarily used as a tool for comparing Jonsson theories from the perspective of their semantic invariants, that is, their semantic models. Many important model-theoretic properties of cosemantic Jonsson theories coincide, which allows us to work not just with a single Jonsson theory, but with an entire class of theories that are cosemantic to it. This approach is directly related to the so-called semantic method proposed by T. G. Mustafin and successfully applied in the study of Jonsson and, more generally, inductive theories.
Let us provide examples of cosemantic Jonsson theories.
Example 2. - (1)
The theory of abelian groups and the theory of divisible abelian groups are cosemantic;
- (2)
The theory of fields of characteristic p, where , is cosemantic to the theory of algebraically closed fields of the same characteristic;
- (3)
The theory of differential fields of characteristic 0 and the theory of differentially closed fields of the same characteristic;
- (4)
The theory of of differentially perfect fields of characteristic p and the theory of differentially closed fields of the same characteristic.
Examples of noncosemantic Jonsson theories are the theory of groups and the theory of abelian groups. Note that the first one is not a perfect Jonsson theory, while the latter is.
It is necessary to note that the cosemanticness relation is an equivalence relation. Let us briefly show the following:
- (1)
For any Jonsson theory T, it is clear that , so ;
- (2)
If that is then and ;
- (3)
Whenever and , it is true that , since .
Thus, cosemanticness is a reflexive, symmetric, and transitive binary relation.
The study of cosemantic Jonsson theories was also conducted by Ye. T. Mustafin. In his work [
10], he outlined several fundamental properties of cosemantic Jonsson theories, and the following is one of them.
Proposition 1 ([
10])
. If T is a Jonsson theory and is an inductive theory such that , then is a Jonsson theory that is cosemantic to T. Proposition 1 naturally implies the following statement:
Proposition 2 ([
6])
. Let and be Jonsson theories. Then, iff . The following fact was obtained by the first author of this paper and allows one to identify the cosemantic Jonsson theories:
Theorem 7 ([
11])
. Let and be two Jonsson theories and let , . Then, . The following two theorems also serve as useful tools in working with cosemantic Jonsson theories, as they allow the construction of extensions of the given Jonsson theory that will be cosemantic to it. Despite their simplicity, these theorems hold significance for our research. Theorem 8 allows us to identify whether an inductive extension of a Jonsson theory T is cosemantic to T. We call such theories cosemantic extensions of T.
Theorem 8 ([
6])
. Let T be a Jonsson L-theory, be its semantic model, and be a theory of the same language such that is inductive, , and . Then is a Jonsson theory that is cosemantic to T. The next theorem is a consequence of Theorem 8 and also shows the way to construct a cosemantic extension of T, but using only existential sentences.
Theorem 9. Let T be a Jonsson L-theory, be its semantic model, and Σ be a set of existential L-sentences such that is consistent for any . Then, is a Jonsson theory that is cosemantic to T.
Proof. According to Theorem 8, it is sufficient for to be satisfied in to be a cosemantic to T. Assume the contrary, let not be a model of . It means that . Then, there is an existential sentence such that . Consequently, , where is equivalent to some universal L-sentence. is an existential model of T due to Theorem 4, and by Theorem 2, for any existentially closed model M of T, . As it was mentioned, for any model , A is embedded into some existentially closed model M of T, since T is inductive. Then, from , it follows that . Hence, any model of T satisfies , which means that , which is a contradiction. Therefore, . We can state this for all sentences using transfinite induction. Thus, applying Theorem 8, we obtain that is cosemantic to T. □
Let
⌀ be an empty set of sentences of the language
L. By definition of an
L-theory,
⌀ is a theory in
L. The class of models of
⌀ is represented by all
L-structures. From [
10], it is known that
⌀ is a Jonsson theory. Then, Theorem 9 has the following interesting corollary, which gives us a new specific example of a Jonsson theory for our further research on cosemantic theories:
Corollary 2. Any existentially axiomatized L-theory is a Jonsson theory cosemantic to ⌀.
Thus, all existentially axiomatized theories are cosemantic to each other.
Now, we apply Theorems 8 and 9 to derive the following results, which are critical for obtaining further conclusions in the next section. These results enable the construction of necessary extensions and provide the foundational tools for the subsequent analysis of the considered Jonsson theories.
Theorem 10. Let T be a Jonsson L-theory and be an L-theory such thatThen is a Jonsson theory cosemantic to T. We demonstrate two alternative proofs for this fact.
Proof 1. Let us show that using the definition of a Jonsson theory (Definition 5).
- (1)
Obviously, has infinite models.
- (2)
The class is closed under the unions of chains. Firstly, note that . Let be a chain of models of , then , since T is inductive. It is clear that A is infinite, then . Therefore, is an inductive theory.
- (3)
Let . Then, there is a model such that A and B are embedded into M. A and B are infinite models; therefore, M is also infinite and . Therefore, admits JEP.
- (4)
Let and f and g be isomorphic embeddings of A and B into C, respectively. Then, there exists and isomorphic embeddings and such that and . are infinite, then D is also infinite and, consequently, . Therefore, admits AP. So is a Jonsson theory. Since is an inductive theory, and , by Theorem 8, .
□
Proof 2. It is clear that
where
is the following set of
L-sentences:
that is
declares the infinity of a structure. All sentences
are existential, and then
is a Jonsson theory cosemantic to
T according to Theorem 9. □
Another canonical tool of the semantic method is the concept of the Jonsson spectrum and cosemanticness of L-structures. Let us recall the definition of the Jonsson spectrum of a class of L-structures.
Definition 12 ([
12])
. Let K be a class of L-structures. A Jonsson spectrum of K is the following set of theories Initially, the concept of cosemanticness of L-structures was proposed by Ye Nurkhaidarov, but it was later reformulated by the first author of this article in order to clarify and expand its applicability within the context of the semantic method. Thus, the following formulation is now relevant:
Definition 13 ([
11])
. L-structures A and B are called cosemantic (denoted by ), if . The concept of the cosemanticness of L-structures serves as a generalization of the notion of elementary equivalence within the framework of Jonsson theory of models, and allows us to encompass a broader class of Jonsson theories under consideration.
In [
13], the concept of cosemanticness of
L-structures was generalized to the cosemanticness of classes of
L-structures. In this manner, we have the following definition:
Definition 14 ([
13])
. Let and be some classes of L-structures. Then, and are said to be cosemantic , if . For a more detailed structural description of the semantic model, we focus on describing the properties of a special class of definable subsets within the model. This method is also a useful feature of the framework used to study Jonsson theories. Moreover, in defining these subsets, we introduce a specific topology on the semantic model of the theory, which broadens the applicability of the method across various mathematical domains. In this paper, when dealing with notions that require the specification of a closure operator, we consider Jonsson theories whose semantic models admit a pregeometry of a special kind, namely, a Jonsson pregeometry.
Definition 15 ([
11])
. Let T be a Jonsson theory, and let . The pair a Jonsson pregeometry τ, if there is a closure operator such that the following conditions hold:- (1)
If , then and ;
- (2)
If , then ;
- (3)
(exchange) If , , and , then ;
- (4)
(finite character) If and , then there is a finite such that .
In this paper, we do not place emphasis on the topological properties of these subsets, but we describe some of the properties related to them using the new concepts defined later in the article. In doing so, we propose new tools to advance the framework for studying the semantic model. Let us give the definitions of some types of described subsets.
Definition 16 (p. 297, [
11])
. Let T be a Jonsson theory and be its semantic model, . X is said to be a Jonsson subset of , if X is an ∃-definable set and , where . For the syntactic description of the properties of the semantic model of a given Jonsson theory using the concepts of Jonsson subsets, we introduce the notion of a Jonsson fragment of a Jonsson subset .
Definition 17 (p. 298, [
11])
. The fragment of a Jonsson subset X is a theory , where . Let T be a Jonsson theory, , and let . That is, X is a Jonsson subset of . Then, and, moreover, the following lemma is true:
Lemma 1 (p. 299, [
11])
. For any Jonsson set , the fragment is a Jonsson theory. Obviously, all axioms of T are true in a semantic model of , that is , and moreover, is existentially closed over T. It means that whenever X is a Jonsson set for T, the semantic model of is always embedded in and an existentially closed submodel of for any Jonsson theory T. To generalize this case and refine possible situations in the context of studying Jonsson theories, we introduce the following notions:
Definition 18 ([
14])
. Let T be a Jonsson theory, be its semantic model, . X is called an almost Jonsson subset of , if X is an ∃
-definable set and , where , and is a Jonsson theory. By analogy with the concept of a Jonsson set, for an almost Jonsson subset of the theory T, we consider the fragment of X:
Definition 19 ([
14])
. The fragment of an almost Jonsson subset X is a theory , where . Based on the previously introduced concepts of Jonsson and almost Jonsson sets, we define a particular subclass of Jonsson theories. This subclass is known as the class of -normal Jonsson theories.
Definition 20. Let τ be some given Jonsson pregeometry. A Jonsson theory T is called normal in pregeometry τ (-normal), if, for each almost Jonsson subset , is an existentially closed submodel of .
The introduction of this definition is necessary because, when studying arbitrary Jonsson theories, there is a risk that the fragments of almost Jonsson subsets in the semantic model may not be closed under cosemanticness. This lack of closure significantly complicates the analysis. By refining the class of theories under consideration, we can obtain more accurate and comprehensive results. Moreover, this refinement still allows for a sufficient number of examples. The following theorem and corollary also provide further examples of -normal Jonsson theories.
Theorem 11. Let T be an inductive theory complete for -sentences. Then, T is a -normal Jonsson theory.
Proof. Let T be an -complete Jonsson theory. Then, for any , which means that is a Jonsson theory for all . Therefore, T is -normal. □
Corollary 3. For any perfect Jonsson theory T, is a -normal Jonsson theory.
Examples of theories satisfying Corollary 3 are as follows:
Example 3. - (1)
The theory of divisible abelian groups;
- (2)
The theory of algebraically closed fields of the fixed characteristic p;
- (3)
The theory of differentially closed fields of the fixed characteristic p and others.
Thus,
Section 1 covered the fundamental model-theoretic concepts and presented the facts relevant to the framework for studying Jonsson theories. Jonsson theories form a special subclass of inductive theories that exhibit certain classical model-theoretic properties with respect to the embedding of models. Key methods for studying are represented by the companion technique of A. Robinson, as well as the semantic method proposed by T. G. Mustafin. The semantic method employs the relation of cosemanticness between Jonsson theories as the primary tool for comparison and general description of theories. Additionally, specific subclasses of Jonsson theories were considered, namely the class of perfect Jonsson theories and the class of
-normal Jonsson theories.
Next, we proceed to the description of the concept of the Kaiser class of a Jonsson theory, which serves as a new tool for a more precise description of cosemantic Jonsson theories. We also provide a description of perfect and -normal Jonsson theories in terms of the Kaiser class.
3. The Kaiser Class of a Jonsson Theory
In the previous section, the concepts of Jonsson sets, almost Jonsson sets, and -normal Jonsson theories were discussed. Within this framework, closures are constructed for the sets under consideration, which serve as models of the given theory. A necessary condition in this case is that the Kaiser hull of such a model must be a Jonsson theory. The description of the class of -normal Jonsson theories presents an interesting and complex task, and thus, our goal is to provide a description of the class of such models. In this context, in this work, we introduce the following definition.
Definition 21. Let T be a Jonsson theory. A class of L-structures is called a Kaiser class of T if Based on the given definition, we can assert that the Kaiser class is a special subclass of the class of models of the considered Jonsson theory, encapsulating the ’Jonsson essence’ of the theory. In this section, we attempt to present some of the key properties of the Kaiser class and describe some of the previously introduced concepts using this concept.
Firstly, we note the following fact:
Lemma 2. For all models , .
Proof. We prove this fact by contradiction. Suppose there is a model
such that
A is finite. It is well known (p. 323 [
7]) that “an
L-structure contains at most
n elements, where
” can be formalized by a universal
L-sentence”. For example, the sentence
states that the
L-structure contains no more that 2 elements. Then, the theory
contains a
L-sentence
that declares the finite cardinality of
A. Then, all models
are finite, so
has no infinite models and is not a Jonsson theory. Hence, all
is an infinite model. □
The following proposition shows that for any Jonsson theory, is never empty.
Proposition 3. For any Jonsson theory T, .
The proof follows from Theorem 5.
Considering the Kaiser class of Jonsson theories, we can present some examples of models from for a Jonsson theory T. Suppose is a theory of all groups, , that is, M is an existentially closed group in . Then, by Proposition 3. Another example of a model that is in but is not existentially closed is the following. Let be the theory of all abelian group, and let N be a divisible abelian group. It is well known that the class of existentially closed models for is represented exactly by divisible abelian groups, then . Then, is a Jonsson theory according to Theorem 5. ; therefore, . Note that N is not existentially closed over .
From Proposition 3, it is also clear that if T is a theory whose Kaiser class is empty, this theory is not Jonsson. There are also theories whose Kaiser class is empty. The following proposition demonstrates this case.
Proposition 4. Let T be an inductive -complete theory that is not Jonsson. Then, .
Proof. Let T be a theory complete for -sentences. Then, any two models of T do not differ by -sentences, and for any . But T is not Jonsson by the condition of the proposition, so there is no such that is a Jonsson theory; therefore, . □
The example of a theory satisfying Proposition 4 is the theory of pairs of algebraically closed fields of fixed characteristic. This theory is complete and inductive, but not Jonsson.
Since the Kaiser class of a Jonsson theory is a special subclass of the models of the theory, the question of its axiomatizability arises. To address this, we examine the Kaiser hull of this class. We also describe some of its model-theoretic properties using the semantic method. This leads to the following first result:
Proposition 5. Let T be a Jonsson theory, then is a Jonsson theory cosemantic to T.
Proof. It is clear that , . By virtue of the inductiveness of Jonsson theory, for any . Consequently, . Note that is an inductive theory. Then, by Theorem 8, is a Jonsson theory cosemantic to T. □
The concept of the Kaiser class is also important in the context of extending the framework of the semantic method. In the classical interpretation of the semantic method, two Jonsson theories are related by examining the comparison of their semantic models, that is, through the relation of cosemanticness. We can refine this approach by instead considering the theories through their Kaiser classes, introducing the following binary relation for Jonsson theories:
Definition 22. Let and be Jonsson L-theories. and are called -equivalent (), if .
Similar to the cosemanticness of Jonsson theories, it is clear that -equivalence is an equivalence relation.
Through the following lemma, we establish a connection between cosemanticness and equivalence of Jonsson theories.
Lemma 3. If Jonsson L-theories and are K-equivalent, then and are cosemantic.
Proof. Let . Then, due to Theorem 4 and Proposition 3, and . We obtain by Theorem 7 that and are cosemantic. □
The converse is generally not true. The example supporting this is provided by two theories:
Example 4. The theory of abelian groups and the theory of divisible abelian groups. The class of models of is represented by existentially closed abelian groups; however, there exist abelian groups that is not e.c. whose Kaiser hull is a Jonsson theory.
Thus, when introducing the relation of -equivalence on the considered class of Jonsson L-theories, we obtain an additional partition within each cosemanticness class.
The next statement shows the connection between the Kaiser classes of two Jonsson theories regarding the relations of equality and cosemanticness of classes of structures.
Theorem 12. For any Jonsson theory T, the following two conditions are equivalent:
- (1)
;
- (2)
.
Proof. The implication (1) → (2) is obvious. We show the implication (2) → (1). Let , i.e., . Since, by Proposition 5, is a Jonsson theory for any Jonsson theory T, and . Consequently, . It follows that and . Then, by virtue of Definition 21, and ; hence, . So, the implication (2) → (1) is true. □
Based on the proposed facts, there arises a need to provide an example of different -equivalent theories. Indeed, the relation of -equivalence is nontrivial, and we demonstrate this in the following section. For this, we need the following theorem, which is a special case of Theorem 8:
Theorem 13. Let T be a Jonsson theory, be the semantic model of T, be an inductive theory such that , . Then, is a Jonsson theory which is -equivalent to T.
Proof. As by virtue of Theorem 3, , which means by Theorem 8 is a Jonsson theory cosemantic to T. From , it follows that . It is also clear that ; hence, , and therefore, , and T and are -equivalent. □
From Theorem 13, we obtain two clear corollaries:
Corollary 4. For any Jonsson theory T, T and are -equivalent.
Corollary 5. For any theory such that , .
And the following corollary allows us to give examples of different Jonsson theories that are -equivalent.
Corollary 6. Let T be a Jonsson L-theory and be an L-theory such thatThen is a Jonsson theory that is -equivalent to T. Proof. According to Theorem 8, is a Jonsson theory, and then is inductive. It is clear that , and due to Lemma 2, ; then, T and are -equivalent. □
In this manner, the examples of Jonsson theories that are
-equivalent are as follows:
Example 5. - (1)
The theory of all (abelian) groups and the theory of all infinite (abelian) groups;
- (2)
The theory of all fields of characteristic and the theory of all infinite fields of the same characteristic;
- (3)
The theory of all differential fields of characteristic and the theory of all infinite differential fields of the same characteristic.
Now, we can consider the class of all theories -equivalent to a given theory T. Here and throughout, we denote this class by .
Theorem 14. Let T be a Jonsson theory. Then, for any theory , .
In other words, in the class of -equivalent theories, is the greatest theory regarding set-theoretic inclusion of theories.
Proof. We prove this theorem by contradiction. Let be a theory such that and . Then, there is a universal–existential L-sentence such that and . Since , for any , it is true that . Consequently, and , which is a contradiction. □
As previously mentioned, in this section, we address the issue of the axiomatizability of the Kaiser class. Speaking of the axiomatizability of a class K of L-structures in general, one of the central problems in Model Theory is the following question: under which conditions does ? The following theorem represents some additional facts regarding this issue.
Theorem 15. Let T be a Jonsson theory complete for -sentences. Then, .
Proof. Let , then, due to -completeness of T, , which is a Jonsson theory. By virtue of the arbitrariness of , it is true for any model of T; therefore, . □
As we can see, the problem of the axiomatizability of the Kaiser class naturally aligns with the classical problem of the axiomatizability of the class of existentially closed models of the given theory. This raises the question: under which conditions does
? A second question arising from the theory of companions is the following: is
a companion of theory T? The answer to this is provided by the following remark:
Remark 1. is not a companion of T.
Proof. The proof follows from the fact that Condition 1 in Definition 9 fails for . Indeed, there are examples of Jonsson theories and that are mutually model consistent and, consequently, by Theorem 1, are cosemantic, but not -equivalent. It means that . Such examples are described in Example 4. □
The following theorems provide insight into the axiomatizability of the Kaiser class.
Theorem 16. For any Jonsson theory T, the class is closed under the joint embedding and amalgamation properties.
Proof. Firstly, let us show the closedness of with respect to JEP. Let . According to Theorem 4 and Proposition 3, . By the definition of a semantic model, there are isomorphic embeddings and ; therefore, is closed with respect to JEP.
Now, consider with respect to AP. Let and and be isomorphic embeddings. Since T is a Jonsson theory and admits an amalgamation property, there is a model and isomorphic embeddings and such that . If , then the proof is completed. If , then we consider an isomorphic embedding that exists by virtue of -universality of . Then, and . Due to -homogeneity of , , which means that is closed with respect to AP. □
Theorem 17. Let T be a Jonsson theory. If is closed under the unions of chains, then .
Proof. By Lemma 2, has infinite models. According to Theorem 16, this class is also closed under AP and JEP. Then, if is closed under the unions of chains, there is a Jonsson theory such that . It is clear that , then . By virtue of Theorem 14, ; therefore, . □
Next, we turn to the description of the class of perfect and the class of -normal Jonsson theories within the framework of the Kaiser class. The application of this technique to the study of perfect Jonsson theories results in a new interpretation of the perfectness criterion (Theorem 6).
Theorem 18. Let T be a Jonsson theory. Then, the following conditions are equivalent:
- (1)
T is a perfect Jonsson theory;
- (2)
.
Proof. According to Theorem 6, . From this, it also follows that . By Proposition 3, . Therefore, . □
To present the results concerning
-normal Jonsson theories using the Kaiser class technique, we require the following lemma, which serves as a criterion for the
-normality of a Jonsson theory in the language of cosemanticness of theories:
Lemma 4. For any Jonsson theory T, the following conditions are equivalent:
- (1)
T is a -normal Jonsson theory;
- (2)
For any almost Jonsson set of T, .
Proof. Firstly, we show the implication (1) → (2). Let T be a -normal Jonsson theory, then for any almost Jonsson set , is a model of T and an existentially closed submodel of . By Theorem 4, is an existentially closed model of T. It is also clear that is a model of T. Then, by Theorem 1, is an existentially closed model of T. Due to Theorem 2, and are elementary equivalent by -sentences, and then is a model of . Therefore, by Theorem 7, .
Now, we show the implication (2) → (1). Let T be a Jonsson theory, be an almost Jonsson set of T, and . Then, . It is obvious that is an existentially closed submodel of and . Therefore, T is a -normal Jonsson theory. □
The following theorem refines Theorem 8 for the case of -normal Jonsson theory and allows us to conclude that the -normality of a Jonsson theory is preserved under its Jonsson extensions.
Theorem 19. Let T be a -normal Jonsson L-theory and be an inductive L-theory such that and . Then, is a -normal Jonsson theory cosemantic to T.
Proof. According to Theorem 8, is a Jonsson theory cosemantic to T. Let be an almost Jonsson set of theory , , then , and is a Jonsson theory. Since , and . Due to the cosemanticness of T and , ; therefore, X is an almost Jonsson subset of the theory T. If T is a -normal Jonsson theory, then the theory is cosemantic to T and . Thus, is a -normal Jonsson theory. □
From Theorem 19, we have two useful corollaries:
Corollary 7. Let T be a -normal Jonsson theory. Then, for any almost Jonsson set of T, is a -normal Jonsson theory.
Proof. Let be an almost Jonsson set of T, , then , is a Jonsson theory. It is clear that and is an inductive theory. T is a -normal Jonsson theory, therefore is an existentially closed submodel of . By Lemma 4, . Then, by Theorem 19, is a -normal Jonsson theory. □
Corollary 8. Let T be a Jonsson theory, be -normal Jonsson theories, and be a theory such that . Then, is a -normal Jonsson theory cosemantic to T.
Proof. Since and are inductive theories, is also an inductive theory. By the condition of the theorem, . Then, . By Theorem 19, it follows that is a -normal Jonsson theory cosemantic to T. □
It is well known that the cosemanticness class of a perfect Jonsson theory contains only perfect Jonsson theories, that is, it is closed under the property of perfectness. This fact directly follows from the definitions of a perfect Jonsson theory and cosemanticness of Jonsson theories. A similar fact can be obtained for the -equivalence class of the Jonsson theory T with respect to -normality:
Theorem 20. Let T be a Jonsson theory and be the -equivalence class of T. Then, if T is a -normal Jonsson theory, any theory is a -normal Jonsson theory.
Proof. Let T be a -normal Jonsson theory, . Due to Lemma 3, is cosemantic to T. Let be an almost Jonsson set of , , then and is a Jonsson theory. It follows that ; therefore, . Then, X is an almost Jonsson set of T. By virtue of -normality of T, is cosemantic to T and . Therefore, is a -normal Jonsson theory. Due to the arbitrariness of , all theories in are -normal Jonsson theories. □
Finally, we present the criterion of -normality for perfect Jonsson theories in terms of the Kaiser class.
Theorem 21. Let T be a perfect Jonsson theory. Then, the following conditions are equivalent:
- (1)
T is a -normal Jonsson theory;
- (2)
For any almost Jonsson set , , .
Proof. Firstly, we show (1) → (2). Let T be a -normal perfect Jonsson theory. Then, by Lemma 4, for any almost Jonsson set of T, ; therefore, . According to Theorem 4 and Proposition 3, and ; therefore, . Since for all , , so this intersection is nonempty.
Now, let , be all almost Jonsson sets of T and let . Let X be a domain of . This set is ∃-definable, and is a Jonsson theory by Theorems 2 and 5. Therefore, X is an almost Jonsson set of T (and even a Jonsson set, since is an existentially closed model of T). By the condition of the theorem, T is a perfect Jonsson theory, then by Theorem 6, and , then . Since , for all . It is also clear that for any , and are inductive theories. Then, by Theorem 8, every fragment is a Jonsson theory cosemantic to T. Hence, T is a -normal Jonsson theory by Lemma 4. □
To conclude, in this section, the concept of the Kaiser class of a Jonsson theory was introduced, along with a description of its basic properties. Additionally, the notions of perfectness and -normality of a Jonsson theory were presented using this concept.
In the next section, we use the obtained results to construct algebraic structures within the class of cosemanticness of an arbitrary fixed Jonsson theory.
4. The Lattices of Cosemantic Jonsson Theories
This section pertains to the question of the algebraization of first-order theories. We consider theories as elements of certain sets, on which we define a lattice algebraic structure. It is known that first-order theories form a lattice under the operations of union and intersection, provided that the theories being considered are consistent in their union. We focus on a specific subclass of theories where the lattice structure is naturally defined and admits some well-described algebraic properties. This approach will later enable us to apply the appropriate methods of Universal Algebra to study the classes of theories we consider.
Firstly, let us recall some basic definitions related to lattice theory [
15].
A lattice L is a partially ordered set where any two elements have both a least upper bound (join) and a greatest lower bound (meet) . These operations satisfy the following properties:
- (1)
Idempotence: .
- (2)
Commutativity: .
- (3)
Associativity: .
- (4)
Absorption: .
A lattice L is called distributive if the following two conditions hold for all :
- (1)
Distributivity of join over meet: .
- (2)
Distributivity of meet over join: .
A lattice
L is said to be convex if for every
, with
, the following condition holds:
In this section, we fix an arbitrary Jonsson theory T and consider its cosemantic class. Here and henceforth, we denote by the class of all L-theories that are cosemantic with T, and by the class of all theories of the given language that are -equivalent to T.
Let us introduce the operations “∨” and “∧” for theories as follows. Let
T and
be
L-theories. Let
if this theory is consistent. This theory is logically equivalent to
, and the class of models of this theory consists of
L-structures that are models of
T and
simultaneously. Let us show that. Let
M be a model of
, let
be any sentence from
T, and let
be any sentence from
. Then,
; therefore,
and
, which means that
and
. Hence,
. We obtain that
. Now, let
N be a model of
. It follows that for any sentence
and any sentence
,
and
; therefore
, and
. Thus,
, and
, and
is logically equivalent to
. From this, we see that
is exactly
L-structures that satisfy both
T and
, that is
.
Let
The class of models of
is represented by
L-structures that are models of
T or
. This fact follows from Lemma 2 of [
13]. Note that
is logically equivalent to
. Let us show this. It is clear that
. Let
M be a model of
, which means that
for any
. Suppose
, then
and
; therefore, there are
L-sentences
and
such that
and
. Then,
and
, and we have that
. But
, and therefore,
, which means that
, since
T is deductively closed set of sentences. The same is for
:
and
, then
and
, which is a contradiction. Hence,
and
; therefore,
.
The foundational result from which we begin is the following theorem proved by Ye T. Mustafin:
Theorem 22 ([
10])
. Let T and be cosemantic Jonsson theories. Then, is also a Jonsson theory that is cosemantic to T and . Another key result upon which we build was established by the first and second authors in [
6]:
Theorem 23. Let K be a class of L-structures and be the Jonsson spectrum of K. Then, any cosemanticness class is a lattice with respect to operations “∨” and “∧”.
Let us illustrate the action of these operations for some sample cosemantic Jonsson theories.
Let
be the theory of all groups with the binary operation “+”, and let
be the following
L-sentence:
which declares that a group is not abelian, and let
be the following sentence:
which states that a group contains more than 2 elements. Then,
and
are Jonsson theories that are cosemantic to
according to Theorem 9. Then,
is logically equivalent to
, which is also a theory cosemantic to
.
As for operation “∨”, the class of models of is the class of all L-structures such that each of them is a nonabelian group or one that contains more than 2 elements; therefore, is logically equivalent to , which is also a Jonsson theory cosemantic to , since is equivalent to existential sentence.
Let be a class of all L-theories cosemantic to T, then Theorem 23 also holds, and is a lattice. We denote this lattice by . The following fact is easy to see:
Proposition 6. is a distributive lattice.
The proof follows from the fact that and for any , where ∪ and ∩ are set-theoretic operations of union and intersection, respectively.
Now, let us consider the -equivalence class of the theory T. We show that the lattice structure can be introduced in this class, too.
Theorem 24. For any Jonsson theory T, is a convex distributive lattice with respect to operations ∧ and ∨.
Proof. Firstly, we show the closedness of with respect to operation ∧. Let . It is obvious that is an -axiomazited (and consequently inductive) theory. and , which means that . It is also clear that . Hence, by Theorem 13, is a Jonsson theory that is -equivalent to and , and .
Now, let us consider with respect to operation ∨. Let again. It follows that and are cosemantic Jonsson theories by 3. According to Theorem 22, is a Jonsson theory cosemantic to and , that is, . It is also clear that . Since , there is no other models in and such that and is a Jonsson theory. Therefore, and .
We assume and .
The distributivity is obvious, since and , where ∪ and ∩ are set-theoretic operations of union and intersection, respectively.
Let us show the convexity of . Let , be an L-theory such that . Then, is an inductive theory. It is also clear that , . , consequently , then by Theorem 13, and .
Thus, is a convex distributive lattice. □
Applying Corollary 5 to Theorem 24, we obtain the following remark:
Remark 2. is a convex sublattice of .
Further, we denote the lattice as .
Continuing the study of the possibility of introducing a lattice structure on the subclasses of the cosemanticness class of T, we obtain the following result concerning the -normal Jonsson theories within this class.
Theorem 25. Let T be a Jonsson theory, be the cosemanticness class of T, be a class of all -normal Jonsson theories of , if it is nonempty. Then, is a distributive lattice with respect to operations ∧ and ∨.
Proof. Let . By Theorem 23, , that is, . It is obvious that is an inductive theory, and ; therefore, by Theorem 19, is a -normal Jonsson theory, and is closed under the operation ∧.
Now, we show that is closed under ∨ as well. In Theorem 23, it is shown that , so . It is also clear that . Let be an almost Jonsson set of , , then and is a Jonsson theory. Then, ; therefore, or . Let , then we may consider X as an almost Jonsson set of and . is a -normal Jonsson theory, hence . It follows that is a -normal Jonsson theory. It is the same when .
We assume and .
The distributivity of the obtained lattice is clear, since and , where ∪ and ∩ are set-theoretic operations of union and intersection, correspondingly.
Thus, is a distributive lattice. □
We apply Corollary 8 to Theorem 25 and obtain the following fact:
Corollary 9. is a convex sublattice of .
Hereafter, we denote the lattice as .
Thus, we examined the lattice structure of the theories of a given class of cosemanticness. By applying the semantic method in the study of Jonsson theories, we aim to generalize the results obtained, transferring properties from individual theories to equivalence classes of these theories whenever possible. This approach allows us to extend the scope of our research and, in the future, apply the results to a broader set of problems. We now apply this approach once more. Specifically, we consider the set of all -equivalence classes of theories from the given class of cosemanticness and demonstrate that a lattice structure can also be defined on this set. To introduce a partial order on this set, we first require the following theorem:
Theorem 26. Let T be a Jonsson theory, be the cosemanticness class of T. Then the relation of -equivalence is congruent on with respect to operations ∧ and ∨.
Proof. As mentioned before, -equivalence is an equivalence relation. We need to show that -equivalence is closed under operations ∧ and ∨.
Let , . Consider . It is clear that and . Similarly, considering , we obtain , and consequently, , i.e., the theories and belong to the same -equivalence class in .
Now, let us consider . It is known that ; therefore, . Considering , we obtain that ; hence, , that is, the theories and also belong to the same -equivalence class. □
Let
T be a Jonsson theory,
be the cosemanticness class of
T,
be
-equivalence classes in
. Let us introduce the binary operation for
-equivalence classes in
as follows. We say that
, if
where
is any theory of
,
is any theory of
.
Similarly, we introduce the operation ∨ for
-equivalence classes
on
as follows:
, if
where
is any theory of
,
is any theory of
.
It is clear that the introduced operations ∧ and ∨ for
-equivalence classes
and
are equivalent to the operations of set-theoretic intersection and union of
and
, correspondingly,
and, similarly,
Consider the cosemanticness class
of a Jonsson theory
T. Introducing the relation of
-equivalence on
, we obtain a factor-set of
by
-equivalence. Let
belong to this factor-set. We introduce the partial order relation ≤ between the
-equivalence classes on
as follows:
By
, we denote the Kaiser class of any theory
. Thus, we may consider the obtained factor-set as a partially ordered set. Then, the following theorem holds.
Theorem 27. The factor-set of by -equivalence is a distributive lattice with respect to operations ∧ and ∨.
Proof. Let be -equivalence classes in . Then, by Theorem 26, there is a unique -equivalence class in such that , that is, the factor-set of by -equivalence is closed under the operation ∧. The same is for the operation ∨. Therefore, the given factor-set is a lattice. We denote this lattice as .
Let us show the distributivity of
. Let
,
,
Then
. Now, we assume that
Then
. Therefore,
and
so the lattice
is distributive. □
As is shown in Theorem 20, each -equivalence class in is closed under -normality of Jonsson theories. In this manner, we say that a -equivalence class in is -normal if it contains a -normal Jonsson theory (and, consequently, all theories in this class are -normal). Let us consider the set of all -normal -equivalence classes in . It is clear that this set is a subset of . Introducing the partial order relation ≤ and the operations ∧ and ∨ as it was performed before, we obtain the following theorem, which describes the algebraic structure of the set of -normal -equivalence classes in .
Theorem 28. -normal -equivalence classes of cosemantic Jonsson theories form a distributive lattice with respect to the operations ∧ and ∨.
Proof. Let
be
-normal
-equivalence classes of Jonsson theories cosemantic to
T. Considering
, we obtain, by Theorem 27, some
-equivalence class
. Let us show that
is a
-normal
-equivalence class. As it was mentioned before,
Let
, and let
be an almost Jonsson subset of
,
, then
is a Jonsson theory.
; hence,
or
. If
, then we can consider
as an almost Jonsson subset of
.
is a
-normal class, therefore
for all
, and
, which means that
for all
. Therefore,
is a
-normal Jonsson theory, which also holds for any theory from
due to Theorem 20. It is the same when
.
The fact that is a -normal class can be proved similarly. Thus, we obtained the lattice of -normal -equivalence classes of cosemantic Jonsson theories. Let us denote it as .
The proof of distributivity of is similar to proving the distributivity of in Theorem 27. □
Theorem 28 implies the following facts:
Corollary 10. is a sublattice of .
Corollary 11. is a homomorphic image of .
Proof. Let us consider the following map: , where is some fixed theory from . Then, for any , , where , and , where . Therefore, f is an algebraic isomorphism of two lattices. It is clear that the theories that correspond to their -equivalence classes form a sublattice in . Then, is a sublattice of . □
By similar way, we obtain the following corollary:
Corollary 12. is a homomorphic image of .
Now, let us summarize all the statements of
Section 3 concerning the embeddings of the considered lattices.
Let T be a Jonsson L-theory, then is the lattice of all theories that cosemantic to T. The following cosemantic theories’ structures are sublattices of :
- (1)
The lattice of theories of an arbitrary -equivalence class in ;
- (2)
The lattice of all -normal theories in .
We also obtain that the lattice of all -equivalence classes in is a homomorphic image of , and the lattice of all -normal -equivalence classes in is a sublattice of .
Note that the algebraic monomorphism can be naturally continued to a monomorphism .
Finally, we would like to draw the attention of our readers to the following ideas, which we believe are relevant and interesting. We are reffering to the transfer of the main notions and results of this article, i.e., the Kaiser class and
-normality of a Jonsson theory for further investigation in the framework of Positive Model Theory. In particular, one can find the start points of positive Jonsson theories in [
16,
17].