Positive Robinson theories and h-maximal models
M. Belkasmi

TL;DR
This paper investigates the structure and properties of h-maximal models and positive Robinson theories within positive logic, providing concrete descriptions and exploring their relation to model properties like quantifier elimination.
Contribution
It offers a detailed description of h-maximal models, studies positive Robinson theories, and links these concepts to model-theoretic properties such as quantifier elimination.
Findings
Concrete description of h-maximal models
Connection between positive Robinson theories and quantifier elimination
Analysis of properties of h-maximal models and their theories
Abstract
In this paper we continue the exploration of the classes of positively closed and h-maximal model of an h-inductive theory in the context of positive logic. In the section 2 we give a concrete description of the class of h-maximal models of an h-inductive theory and theirs companion theories. The section 3 is concerned to the study of the positive Robinson and locally positive Robinson theories and their connexion with the properties of the class of h-maximal models of the companion theories, and their connexion with the property of elimination of quantifiers. Before dealing with the topics mentioned above we give in section 1 a brief introduction to the positive model theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Advanced Algebra and Logic · Computability, Logic, AI Algorithms
Positive Robinson theories and h-maximal models
Mohammed Belkasmi
Introduction
In this paper we continue the exploration of the classes of positively closed and h-maximal model of an h-inductive theory in the context of positive logic.
In the section 2 we give a concrete description of the class of h-maximal models of an h-inductive theory and theirs companion theories. The section 3 is concerned to the study of the positive Robinson and locally positive Robinson theories and their connexion with the properties of the class of h-maximal models of the companion theories, and their connexion with the property of elimination of quantifiers. Before dealing with the topics mentioned above we give in section 1 a brief introduction to the positive model theory.
1 Positive model theory
The positive logic is a continuation of the line of research on universal theories initiated by Abraham Robinson, based on the study of the notions of inductive theories, existentially closed models, model-complete theories through the notions of embedding, existential formula. The systematic treatment of the positive model theory has been undertaken by Ben Yaacov and Poizat in [2].
In short consists of non-use of negation in building of formulas.
Let be a first order language. The positive formulas are expressed as: , where is a formula, the variables are said to be free.
A sentence is a formula without free variables. A sentence is said to be h-inductive (resp. f-inductive) if it is a finite conjunction of sentences of the form:
[TABLE]
(resp. ) where (resp. ) are quantifier-free positive formulas.
The h-universal sentences represent a special case of h-inductive sentences, they are the sentences that can be written as negation of a positive sentence.
Given two L-structures and be over an arbitrary language . A mapping from into is a homomorphism if for every and for every positive atomic formula ;
[TABLE]
A structure is said to be a continuation of a structure if and only if there exists a homomorphism from into .
A homomorphism is an embedding if and only if for every the tuples and satisfy the same atomic formulas.
A homomorphism is an immersion if and only if for every and for every positive formula ; if and only if . We say that is immersed in if there exist an immersion from into .
A class of L-structures is said to be h-inductive if it is closed with respect to inductive limits of homomorphisms. In [2] it is shown that the class of models of an -inductive theory is h-inductive and the class of models of an arbitrary theory is h-inductive if is axiomatized by an h-inductive theory.
1.1 positively closed structures
Definition 1
A member of a class of -structures is said to be positively closed (pc from now on) in , if every homomorphism from into a member of is an immersion.
Fact 1** ([2, Theorem 1])**
Every member of an h-inductive class of -structures has a positively closed continuation in the same class.
The h-inductivity of the class is a necessary condition of the existence of pc structure. In this case The class of pc members of forms an h-inductive and h-cofinal subclass of .
Let be an h-inductive class of . We denote by the class of positively closed member of . If is the class of models of an h-inductive theory , we use the notation .
Definition 2
Two -inductive theories over a language are said to be companions if they have the same pc models.
Note that every -inductive theory admits:
- •
A maximal companion theory denoted , called the Kaiser’s hull theory of . By definition is the set of -inductive sentences satisfied by the pc models of .
- •
A minimal companion theory denoted , it is the set of h-universal sentences true in the pc models of .
Let be a first order language and be a -structure.
- •
we denote by (resp. ) the set of h-inductive (resp. of h-universal) sentences satisfied by in the language obtained from by adding the elements of as constants.
- •
we denote by (resp. ) the set of h-inductive (resp. of h-universal) -sentences satisfied by .
Note that for every L-structure we have;
[TABLE]
In the language obtained from by adding the elements of as constants. We have;
[TABLE]
If a pc model of an h-inductive theory . We obtain;
[TABLE]
In this case we use the notation instead of .
Definition 3
Let be an h-inductive theory.
- •
* is said to be model-complete if every model of is a pc model of .*
- •
We say that has a model-companion whenever is model-complete.
- •
An -type is a maximal set of positive formulas in variables that is consistent with . We denote by the space of -types of a theory .
Let be a L-structure and a tuple of . We denote by the set of positive formulas satisfied by in .
Fact 2
* is pc model of if and only if, for every , the set of positive formulas satisfied by is a type of .*
For every positive formula , we denote by the set of positive formulas such that .
Let be a pc model of . Let such that where is a positive formula. By the maximality of , there is a positive formula such that .
This property is in fact the inner characteristic of these subclass of models of . We have the following fact.
Fact 3
* is pc model of if and only if for every , and for every positive formula ; if there exists a positive formula such that and .*
Consider a pc model of and . We denote by (resp. ) the type of in (resp. the set of quantifier-free positive formulas satisfied by in ).
One defines on the topology generated by the following basis of closed sets:
[TABLE]
where ranges over the set of positive formulas.
Note that for every , The space of positive types is compact but generally is not Hausdorff.
Definition 4
Let be an h-inductive theory and a positive formula;
- •
* is said to be -complemented if and only if there is a positive formula such that;*
[TABLE]
The formula is called the -complement of .
- •
Let be a subset of . We say that is logically equivalent to modulo and we writ ; if and only if for every there is such that
[TABLE]
Remark 1
Let be an h-inductive theory.
- •
A formula is -complemented if and only if there is a positive formula such that .
- •
The class of pc models of is elementary if and only if, for every positive formula , is logically equivalent modulo to a positive formula.
Exemples 1
Let be the relational language formed a binary relation . Consider the following h-inductive theory:
[TABLE]
The model of formed by the p-cycles where or is a prime number greater-than or equal to is the unique pc model of .
Let be the theory obtained from By adding the h-universal sentence
[TABLE]
The structure formed by the -cycles where ranges over the set of prime numbers greater-than or equal to is the unique pc model of . 2. 2.
Let and be the language and the theory given in the example above. Let be an integer greater-than 3. Consider the h-inductive theory obtained from by adding the following set of h-inductive sentences
[TABLE]
The structure formed by the p-cycles where is a prime number less than is the unique pc model of . Thereby has a model-companion. 3. 3.
Let be the h-inductive theory of abelian groups in the language . In the positive logic has a model-companion. The trivial group is the unique pc model of . However, in the context of first order logic the class of existentially closed abelian groups is the class of divisible abelian groups which contain for each prime an infinite number elements of order (theorem 2.4 **[3]**).
To extend the discussion began on the last example. Consider the language obtained from the language of the theory by adding a constant . Let be the h-inductive theory .
Let be a pc model of where is the interpretation of the constant in , we have the following properties
The constant belongs to every non trivial subgroup of . Indeed let be a non trivial subgroup of and the L-homomorphism . Suppose that is a -homomorphism. Then is an immersion. Consequently . Thereby can not be a -homomorphism, so .
The constant belongs to the intersection of all subgroups of . Thereby for every there is such that . 2. 2.
cannot admit distinct subgroups of order and respectively, where and are prime to each other. Because if not, the order of will be a common divisor of and . 3. 3.
cannot be the direct sum of some of its subgroups; because the constant must belong to the intersection of all subgroups.
Lemma 1
The pc models of are the groups , where is a prime number, , and is the group of all complex -th roots of unity.
Proof. Let be a pc model of . We distinguish two cases:
- •
(the order of in ) is finite. In this case is a prime number. Indeed, if not we can find a subgroup of that does not contain the constant .
- •
is infinite. This case cannot take place because we can find a subgroup of which does not contain the constant .
Therefore, if is a pc model of there is a prime number such that is the group of all complex -th roots of unity.
1.2 Amalgamation property
The notion of amalgamation in positive logic provides a useful means for intuition and motivation. One of these facts is the characterization of the Hausdorff property by the amalgamation property given in [2]. For more expositions of these facts see [1, 2].
Definition 5
Let be a class of L-structures. An element of is said to be an amalgamation basis of if and only if, for every in , and homomorphisms from respectively into and , there exist and homomorphisms such that the following diagram commutes:
[TABLE]
We say that has the amalgamation property if every element of is an amalgamation basis of .
Note that under certain conditions, each structure can benefit of the property of being an amalgamation basis. On other words in every class of L-structures, we can always find universal amalgamations. The useful following fact provides an example of these universal amalgamations.
Fact 4** ([1, lemma 4])**
Let be L-structures such that; is immersed in and continued in by a homomorphism . Then there is a model of such that the following diagram commutes.
[TABLE]
Where in the diagram are immersions and a homomorphism.
One of the most important property of the class of pc models of an h-inductive theory is the amalgamation property (theorem 9[2]). As a simple application of the amalgamation property we have the following lemma.
Lemma 2
Let be an h-inductive theory such that the class of pc model (resp. of amalgamation bases) is closed under product. Then has only one pc model, this pc model has only one point.
Proof. Let be two pc models of . Since is a pc model (resp. an amalgamation basis), we obtain the following commutative diagram:
[TABLE]
where is a pc model of , and are immersions. Thus for all and we have , and so . Consequently every constant mapping from into is an immersion. Thereby .
1.3 Complete theories
Definition 6
An h-inductive theory is said to be complete or has joint continuation property if any two of its models can be simultaneous continued into a third one.
Remark 2
- •
let be two pc models of . if and only if and have the same continuation.
- •
an h-inductive theory is complete if and only if its pc models have the same h-inductive theory.
Lemma 3
Let be a pc model of then is a complete theory.
Proof. Let be models of . Firstly we show that
is consistent, then we conclude that
is consistent.
Since for every we have , and , then by compactness we obtain the consistency of .
Now, let be a model of and a model of . Since the class of pc models of has the amalgamation property, and are models of . We obtain the following commutative diagram:
[TABLE]
where are immersions, are homomorphisms and is a model of that can be assumed a pc model of . Thus, is an immersion, and is a model of in which and are immersed. Consequently is consistent, and is complete theory.
Corollary 1
Let be a pc model of . Every pc model of is a pc model of .
Proof. Let be a pc model of and a pc model of such that is continued in by a homomorphism . By the lemma 3 and the fact4 we obtain the following commutative diagram:
[TABLE]
where is a model of in which and are immersed (lemma 3). (fact4). is a pc model of in which is continued by a homomorphism .
Now, since and are pc models of , then is an immersion and . By the fact that is a pc model of we deduce that is an immersion. Consequently is an immersion and is a pc model of .
Lemma 4
Let and be two h-inductive theories such that is a complete theory and there exists a common pc model of and , then every pc model of is a pc model of .
Proof. Let be a pc model of . Since is a common pc model of and , and is a complete theory, then
[TABLE]
This implies that is a model of .
On the other hand, since is complete there exist a pc model of in which and are immersed, and so is a model of . Let be a pc model of in which is continued by an homomorphism as shown in the following diagram
[TABLE]
where denotes immersions. Given that and are pc models of we obtain . Consequently and is an immersion, so and are pc models of .
2 H-maximal models
In [5] Kungozhin introduced the notion of h-maximal model in the context of studying the elementarity of the classes of pc modeles and h-maximal models of finitely universal theories. In this section ????
Definition 7
Let be an h-inductive theory. A model of is said to be h-maximal if every homomorphism from into a model of is an embedding.
Note that the class of h-maximal models of an h-inductive theory forms an inductive class and every model of is continued in a h-maximal model of .
Exemples 2
Let and be the theories defined in [1, example1]. The class of h-maximal models of (resp. ) is the class of substructures of the pc model of (resp. ). 2. 2.
The class of h-maximal models of the theory given in [2, example 1] is the class of substructures of the pc model of . This implies that the class of h-maximal models of is not elementary. 3. 3.
The class of h-maximal models of is the class of pc models of . 4. 4.
Consider the theory of groups in the language . The h-maximal models of are the groups whose non trivial normal subgroups contain the constant of the language . Indeed, since the -homomorphisms are The homomorphisms of groups such that where is the interpretation constant of . Thus if is a h-maximal model of and a non trivial normal subgroup of such that . The canonical mapping from into is a -homomorphism but not an embedding. Thereby can not be h-maximal model.
Remark 3
If and are h-inductive classes that have the same h-maximal models. Then they are companion theories.
Let be an h-inductive theory and the set of h-inductive sentences satisfied in each h-maximal model of . Given that the class of pc models of is a subclass of the class of h-maximal models of , then . So and are companion theories.
Definition 8
Let be an h-inductive theory and the set of sentences of the form satisfied in every h-maximal model of and such that and are quantifier-free positive formulas. We denote by the h-inductive theory . we have
[TABLE]
Lemma 5
The h-inductive theories and have the same class of h-maximal models.
Proof. Let be a h-maximal model of , a model of and a model of . Let (resp. ) be a homomorphism from into (resp. into ). Since and are models of , and is a model of both theories and then and are embeddings, and is a h-maximal of and .
Let be a h-maximal model of . Given that is a model of the theories and , there are a model of and a model such that is continued in by a homomorphism and continued in by a homomorphism . Since and are also models of , there exist and h-maximal models of such that is continued in by a homomorphism , is continued in by a homomorphism . Now given that and are models of then and are embeddings. Thereby and are embeddings. Consequently is a h-maximal of and .
By the same way we show that every h-maximal of is a h-maximal of . Therefore the theories and have the same class of h-maximal models.
Remark 4
Consider an h-inductive theory. We denote by the class of h-maximal model of . We have .
Lemma 6
*A model of is h-maximal model if and only if for every quantifier-free positive formula and a tuple such that , there is a positive formula such that .
Proof. Let be a h-maximal model of , and a quantifier-free positive formula such that . Since every homomorphism from into a model of is an embedding then the set of h-inductive sentences is inconsistent. Thus by compactness there exists such that where is the positive formula .
Conversely, let be a model of such that for every quantifier-free positive formula and , if then there is a positive formula such that and . It is obvious that every homomorphism from into a model of is an embedding, then is a h-maximal model of .
Corollary 2
If is immersed in a h-maximal model of then .
Proof. Since is immersed in a model of then . The fact that is h-maximal results of the lemma 6.
Theorem 1
* is elementary class if and only if for every quantifier-free positive formula , there is a positive formula such that*
[TABLE]
Proof. Suppose that is elementary and axiomatized by . Assume the existence of a quantifier-free positive formula such that is not equivalent modulo to any positive formula. By compactness, there is a model of and such that , and for every positive formula we have , which contradicts the lemma 6.
For the reverse direction, suppose that for every quantifier-free positive formula , there is a positive formula such that . Let be a model of . By the lemma 6 it is clear that is a h-maximal model of .
Corollary 3
If is elementary then is elementary and axiomatized by .
Proof. Suppose that is axiomatised by . by the theorem (1), for every quantifier-free positive formula there is a positive formula such that . Given that , then every model of is a h-maximal model of .
Lemma 7
If is elementary then it is axiomatized by .
Proof. Suppose that is axiomatized by an h-inductive theory . Then and are companion theories. Given that is the maximal companion of we obtain .
3 Positive Robinson and locally positive Robinson theories
In [4] Hrushovski defined Robinson theories to be the universal theory that admits the quantifier separation. The quantifier-free types are the main object of the study of Robinson theories. In our context we adopt this property to define the notion of positive Robinson theories and locally positive Robinson theories.
Definition 9
*An -inductive theory is said to be positive Robinson theory (in short. pR theory) if it satisfies the following condition:
For any pc models and of , and . If then . (where is the set of quantifier-free positive formulas satisfied by in ).
An h-inductive theory is said to be a locally positive Robinson theory (in short. lpR theory) if the following conditions is satisfied for any pc model of .*
[TABLE]
Given that the property of being a pR theory or a lpR theory concerns the class of pc models. we have the following remarks.
Remark 5
- •
* is a pR theory (resp. lpR theory) provided that each companion theory of is a pR theory (resp. lpR theory).*
- •
If is a pR theory then is a lpR theory.
Fact 5
[Lemma 8, [1]] An -inductive theory is a pR theory if and only if for every positive formula , is equivalent modulo to a set of quantifier-free positive formulas.
Remark 6
Let be a pR theory. If and a model of which is embedded in . Then .
Theorem 2
* is lpR h-inductive theory if and only if for every pc model of , and a positive formula we have the following property:
for every tuple , if then there exists a free positive formula such that, and .*
Proof. Suppose that is a lpR theory. Let be a pc model of , and a positive formula such that, . We will show that is inconsistent, where is the set of quantifier-free positive formulas satisfied by in the pc model .
Suppose that is consistent. Let a model of in the language . We claim that is consistent. Indeed if not, by compactness there exist a quantifier-free positive formula such that is inconsistent. Given that then . On the other hand, since and we obtain , contradiction. Thereby is consistent. Let be a model of , so and are continued in . Let the interpretation of in , and the interpretation of in . Given that every model of is continued in some pc model of , we can take a pc model of .
Considering that is a pc model of , it is immersed in , thereby we obtain . Since , we have
[TABLE]
Since is lpR theory we have .
Given that and then and . Contradiction. Therefore is inconsistent, by compactness there exists such that .
For the reverse direction, suppose that for every pc model of , , and a positive formula we have the following property:
if then there exists a quantifier-free positive formula such that , and . Let and be tuples of such that . Assume the existence of a positive formula such that and . By hypothesis there is a quantifier-free positive formula such that and . Thus , but we have . Contradiction. Thereby is lpR theory.
Lemma 8
An h-inductive theory is lpR if and only if for every pc model of , is a pR theory.
Proof. Suppose that is a lpR theory. Let be a pc model of . Let and be two pc models of . Consider and such that . By the lemma 3, the sets and are consistent. From the fact 4 we obtain the following diagram:
[TABLE]
where and that can be taken pc models of . are immersions, a model of and a pc model of in which is continued. Given that and are pc models of then is an immersion, which implies that is a model of . Let be a pc model of in which is continued.
Since and are immersions, we have;
[TABLE]
Given that is a lpR theory and is a pc model of we obtain . On the other hand, as is a pc model of and is immersed in , then is a pc model of , thereby , wich implies that is a pR theory.
The other direction of the proof is obvious.
Fact 6
*[Lemma, [1]] Let be a pR theory. We have the following properties:
-
Every model of that embeds in a pc model of is -maximal model of .
-
The -maximal models of have the amalgamation property.
Moreover, if is -universal the two conditions above imply that is a pR theory.*
From the fact 6 and the definition of pR theories we obtain the following slightly modified version of the fact6.
Lemma 9
An h-inductive theory is pR if and only if the class of substructures of the h-maximal models of has the amalgamation property.
Proof. Suppose that is a pR theory, then the h-universal companion of is also a pR theory. Given that the class of substructures of the h-maximal models of is the class of h-maximal model of , by the fact 6, has the amalgamation property.
For the other direction of the proof, assume that the class has the amalgamation property. By the fact 6, and thus are pR theories.
Corollary 4
If the class of pc model of is closed under substructures then is a pR theory.
Proof. Since every pc model is a h-maximal model and the class of pc models has the amalgamation property, the proof follows from the lemma 9
Corollary 5
* is a pR theory.*
Exemples 3
Let be an h-inductive theory that satisfies the following property:
For every pc model of and for every positive formula , there exists a family of free-positive formulas such that:
- •
for every we have .
- •
, if then there is such that .
We claim that is a lpR theory, and for every pc model of the class of h-maximal models of is the class of pc model of .
Indeed, let be a pc model of , and be tuples from such that . Let be a positive formula such that , by hypothesis there is a quantifier-free positive formula such that , and . Given that and , then and thereby . Consequently , as is a pc, by maximality of types we obtain .
Now, let be a h-maximal of and a pc model of in which is embedded. Let a positive formula such that where , then there is a quantifier-free positive formula such that:
[TABLE]
Since is embedded in and is a quantifier-free formula then , so . Consequently is immersed in which implies that is a pc model of .
Theories whose pc are finite provide a concrete example of theories with the above property. 2. 2.
Let be an h-inductive theory such that for every positive formula there is a family of quantifier-free positive formula such that
- •
.
- •
For every pc model of and a tuple of . If then for same .
Then is a pR theory, and every h-maximal model of is a pc model of . 3. 3.
Let be the language formed by the function symbol or arity 1. Let be the h-universal theory . In (**[5]**, example 3) it is shown that the unique pc model of is the model formed by the -cycle (cycle of length ) where runs through the set of prime numbers. The h-maximal models of are the substructures of the pc model of .
*It is obvious that is a pR theory. *
Theorem 3
Let be a pR theory with a model-companion. Then every positive formula is equivalent modulo to a quantifier-free positive formula.
Proof. Since is pR theory with a model-companion then for each positive formula there is a quantifier-free positive formula such that
[TABLE]
We repeat the same reasoning for the quantifier-free positive formula and we obtain a quantifier-free positive formula such that,
[TABLE]
which implies that .
Corollary 6
Let be a lpR theory such that for every pc model of , the theory has a model-companion. Then every positive formula is equivalent modulo to a quantifier-free positive formula.
Exemple 1
For every pc model of . Every positive formula in the language of the theory is equivalent modulo to a quantifier-free positive formula.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Mohammed Belkasmi. Positive model theory and amalgamations . Notre Dame Journal of Formal Logic , vol. 55, (2014), 205-229.
- 2[2] Itaï Ben Yaacov, Bruno Poizat. Fondements de la logique positive . Journal of Symbolic Logic , 72, 4, 1141–1162, 2007.
- 3[3] P Eklof, G Sabbag. model-completions and modules . Annals of Mathematical logic , vol. 2 N.3(1971), 251–295.
- 4[4] Ehud Hrushovski. Simplicity and the Lascar group . Preprint , 1998.
- 5[5] Almaz Kungozhin. Existentially closed and maximal models in positive logic . Algebra i Logika , vol. 51, (2012), 748-65.
- 6[6] Bruno Poizat, Aibat Yeshkeyev. Jonsson theories in positive logic . Logica Universalis , 12 (1-2):101-127 (2018).
