1. Introduction
A central program in pure model theory is to develop the theory of independence, which originated within the stable theories, beyond stability and simplicity. This has been successful for the original notion of forking-independence within theories: for example, Chernikov and Kaplan, in [9], show that forking coincides with dividing in theories; Ben-Yaacov and Chernikov, in [42], give an independence theorem for forking-independence in theories that is improved by Simon in [40], and Chernikov, in [8], studies simple types in theories and gives a characterization of theories in terms of Kim’s lemma. In a different direction, Kaplan and Ramsey in [19] extend the original theory of independence in simple theories to theories by introducing the notion of Kim-independence, described as forking-independence “at a generic scale.” Kaplan and Ramsey, in [19], show, using work of Chernikov and Ramsey in [10], that symmetry of Kim-independence characterizes the property ; they also show that the independence theorem for Kim-independence characterizes . To give examples of further consequences of for the theory of Kim-independence, Kaplan and Ramsey in [20] give a characterization of in terms of transitivity, Kaplan, Ramsey and Shelah in [21] give a characterization in terms of local character; Dobrowolski, Kim and Ramsey in [13] and Chernikov, Kim and Ramsey in [6] study independence over arbitrary sets in theories. Kruckman and Ramsey, in [27], prove an improved independence theorem, developed further by Kruckman, Tran and Walsberg in the appendix of [28]. Kim ([23]) initiates a theory of canonical bases. For extensions to positive logic, see [12], [17], [5]; see also [7] for extensions of Kim-independence to theories. Beyond and , the author in [35] develops a theory of independence in theories and uses this to show that every theory is in fact , and Kim and Lee, in [25], use remarks by the author in [35] to develop Kim-forking and Kim-dividing in the theories introduced by Ahn and Kim in [3] and further devloped by Ahn, Kim and Lee in [4], as well as the related -- theories introduced by the author in [35].
However, much remains to be understood about the theory of independence in Shelah’s strong order hierarchy, , for . In [36], the author relativizes the theory of Kim-indpendence in [10], [19] by developing a theory of independence relative to abstract independence relations generalizing the free amalgamation axioms of [11]; though the theories to which this result applies may be strictly ( and ) as well as , is not actually used in the result. The author also observes in the same paper using the generalization in [35] of the arguments of [11] that theories possessing independence properties with no known counterxamples–symmetric Conant-independence and the strong witnessing property that generalizes Kim’s lemma–cannot be strictly . Conant-independence, which can be described as forking-independence at a maximally generic scale and is grounded in the strong Kim-dividing of [21], is introduced in that paper (based on a similar notion with the same name developed in [35] to show the equivalence of and ) as a potential extension of the theory of Kim-independence beyond . There the author shows that a theory where Conant-independence is symmetric must be , and characterizes Conant-independence in most of the known examples of theories, where it is symmetric. This leaves open the question of whether Conant-independence is symmetric in any theory, a question intimately related to the question of whether any theory is . In [18], Kaplan, Ramsey and Simon have recently shown that all binary theories are simple, by developing a theory of independence for a class of theories containing all binary theories. In [34] the author develops the independence relations , based on the same idea of forking-independence at a maximally generic scale, shows that any theory where is symmetric must be , and characterizes in the classical examples of theories, leaving open the question of whether is symmetric in any theory. (Demonstrating robustness of the result, the author proves a similar result for left and right transitivity.) In [32], Malliaris and Shelah initiate a structure theory for theories, though instead of a theory of independence along the lines of forking-independence or Kim-independence, they show symmetric inconsistency for higher formulas, a result on sequences of realizations of two invariant types yielding inconsistent instances of two formulas, rather than any kind of indiscernible sequence witnessing the dividing of a single formula. Malliaris, in [33], also investigates the graph-theoretic depth of independence in theories. The pressing question remains, for : using the assumption that is (and possibly some additional assumptions that are not already known to collapse into ), can we show any properties of that fit into the program of generalizing the properties of independence in stable or simple theories, as was done for and theories?
The aim of this paper is to show that this question is tractable for theories, whose equivalence with remains open. We prove three results on theories, two about the “building blocks” of theories and the independence relations between them in the global structure, and one about theories with symmetric Conant-independence. All three of these results truly use in that they fail when the assumption is relaxed to (and the first two results, though both concerning the local structure, involve separate uses of in a sense that will become apparent.) The first and third result will also appear similar to properties known or proposed for theories, in contrast to the open question of whether coincides with simplicity for , which would suggest that is much different from .
We give an outline of the paper.
In Section 3 we generalize work of Chernikov ([8]) on simple types in theories. As the property -- is a subclass of which is one potential solution to [26]’s proposed analogy “simple : :: : ,” ([35], [25]), it is to be expected that the analogous result for “ types” holds for -- theories. What is not predicted by this analogy is that the same result on local structure holds in theories. Instead of generalizing the definition of simple types, we introduce a definition schema for the internal properties of a (partial) type, which is more natural in that it refers to the global properties of a structure associated with that type. (We could also have generalized the defintion of simple types to and gotten the same conclusion; see Remark 3.6.) We show that just as Chernikov implicitly showed in ([8]) for internally simple types in theories, the assumption of controls how internally types relate to the rest of the structure:
Theorem 1.1.
Let be , and an internally type. Then is co-.
See Definitions 3.1 and 3.3. When is only assumed to be , we give an internally simple type for which this fails.
We then interpret the proof of this result as well the results of Chernikov in [8] (and their direct generalization to --) in terms of the characteristic sequences introduced by Malliaris in [30] to relate “classification-theoretic properties” of a theory to the “graph-theoretic properties” of hypergraphs, and used by Malliaris in [31] to study Keisler’s order. Internally to a type , what the ambient theory perceives to be an instance of co- (an instance of with parameters realizing ) is simply a definable hypergraph making no reference to consistency. Model-theoretic properties of a theory will give control of the graph-theoretic structure of hypergraphs definable in that theory, similarly to Shelah’s classic result that an definable bipartite graph with the order property in an theory must even have the independence property. Applied in the case where the model-theoretic properties, such as simplicity and , are assumed of the internal structure on , this will illuminate the proof in [8] of co-simplicity in theories and our proof of co- in -- and theories.
In Section 4, we discuss how internally types interrelate within the ambient structure of a theory, showing that their behavior is similar to how they would interrelate in a globally theory. By the Kim-Pillay characterization of , Theorem 9.1 of [19], for no reasonable notion of independence could a full independence theorem hold in an (that is, non-) theory. However, we prove an independence theorem between internally types in theories:
Theorem 1.2.
Let be , and let be internally types over . Let , , . If , , , there is some with . Moreover, can be chosen with , and .
Here is Conant-independence, Definition 2.3. Motivating this result, in an theory, Conant-independence coincides with Kim-independence, and is symmetric; compare [19], Theorem 6.5, which characterizes . (Between tuples of realizations of two co- types it coincides with Kim-diving independence.) While in proving this result, we apply 1.1, it does not just follow from co-: we exhibit internally stable types in an theory for which this fails. This independence theorem for internally types in theories is not only of interest to the program of extending the theory of independence beyond theories; it is also of interest to the question of whether coincides with . One potential approach to building a strictly theory (that is, one that is ) is by starting with structures and somehow combining them to obtain a failure of in the form of a failure of the independence theorem: this result says that it is impossible to obtain an theory from such a construction. It may be of interest to ask whether there is any connection between this result on stability-theoretic independence and Theorem 7.7 of [33], which concerns the graph-theoretic depth of independence in theories.
In section 5, we consider theories where Conant-independence is symmetric. It is natural to assume this, as there is no known theory where Conant-independence or Conant-dividing independence is not symmetric. Simon, in [40], proves an improved independence theorem for theories, Fact 5.1, and poses an existence question, Question 5.2, for invariant types with the same Morley sequence in theories; an independence theorem for forking-independence, for invariant types with the same Morley sequence in theories, would follow from a positive answer to this question, by Simon’s result. In an theory with symmetric Conant-independence, we prove a similar independence theorem for Conant-independence between finitely satisfiable types with the same Morley sequence:
Theorem 1.3.
Let be an theory, and assume is symmetric. Suppose and are -finitely satisfiable (global) types with , and let be small supersets of with . Then there is with .
This fails when is the model companion of triangle-free graphs, which is with symmetric (indeed trivial) Conant-independence. We also give an extension of this result from finitely satisfiable types to Kim-nonforking types when Conant-dividing independence is symmetric, which has the advantage of exploiting the full force of symmetry for Conant-independence. While this result is again of interest to the question of extending the theory of independence beyond , since there is precedent (see [35]) for using facts about independence to prove the equivalence of classification-theoretic dividing lines, it is also of interest to another open question, whether an theory with symmetric Conant-independence is .
One final remark: in Theorem 3.15 of [36], a strategy was suggested for proving the equivalence of and by proving two facts that have no known counterexamples, symmetry for Conant-independence and the strong witnessing property, for all or even all theories. The results of this paper suggest a different approach, via finding properties of independence in theories that distinguish them from theories.
2. Preliminaries
Notations are standard. We will need some basic defintions and facts about some standard relations between sets, as well as some facts about and theories.
Adler, in [2], defines some properties of abstract ternary relations between sets. In our case, we will assume is a model, and we will only need to refer to a few of these properties by name:
Left extension: If and , there is some with .
Right extension: If and , there is some with .
Symmetry: If then .
Chain condition with respect to invariant Morley sequences: If and is an invariant Morley sequence over (see below) with , then there is indiscernible over with .
We will refer to various relations between sets. For the convenience of the reader, here is an index of the notation to be used. Kim-independence and Kim-dividing, as well as Conant-independence and Conant-dividing, will be defined later in this section.
if extends to a global -invariant type
if extends to a global -finitely satisfiable type
if is forking-independent from over
if is Kim-independent from over
if is Conant-independent from over
if contains no formulas Kim-dividing over
if contains no formulas Conant-dividing over .
We will use and as ad-hoc notations in proofs; these will be defined in the course of those proofs.
We give an overview of some basic definitions. A global type is a complete type over the sufficiently saturated model . For , a global type is invariant over if and implies . One class of types invariant over is the class of types that are finitely satisfiable over , meaning any formula in the type is satisfied by some element of . We say an infinite sequence , is an invariant Morley sequence over (in the type ) if there is a fixed global type invariant over so that for . If is finitely satisfiable over , we say is a coheir Morley sequence or finitely satisfiable Morley sequence over . Invariant Morley sequences over are indiscernible over , and the EM-type of an invariant Morley sequence over depends only on . For -invariant types, is defined so that for when and .
Both and have right extension, but it is sometimes advantageous to work with coheir Morley sequences rather than general invariant Morley sequences because is also known to have left extensions.
Kim-indepedence and
We assume knowledge of basic simplicity theory and the definition of forking-independence. An extension of the theory of independence from simple theories to theories was developed by Kaplan and Ramsey in [19], via the definition of Kim-independence
Definition 2.1.
A theory is if there does not exist a formula and tuples so that is consistent for any , but for any , is inconsistent. Otherwise it is .
Definition 2.2.
([19])
A formula Kim-divides over if there is an invariant Morley sequence starting with (said to witness the Kim-dividing) so that is inconsistent. A formula Kim-forks over if it implies a (finite) disjunction of formulas Kim-dividing over . We write , and say that is Kim-independent from over if does not include any formulas Kim-forking over .
Kim-independence in theories behaves, in many ways, like forking-independence in simple theories.
Fact 2.1.
([19]) Let be . Then for any formula Kim-dividing over , any invariant Morley sequence over starting with witnesses Kim-dividing of over . Conversely, suppose that for any formula Kim-dividing over , any invariant Morley sequence (even in a finitely satisfiable type) over starting with witnesses Kim-dividing of over . Then is .
It follows that Kim-forking coincides with Kim-dividing in any theory.
Fact 2.2.
([10], [19]) The theory is if and only if is symmetric.
The independence theorem for Kim-independence in theories generalizes that of [24] for simple theories, which in turn generalizes stationarity of forking-independence (the uniqueness of nonforking-extensions) in stable theories. Part of our argument for the results of section 4 will require re-proving the independence theorem in the context of co- types. For motivation, we give the original statement:
Fact 2.3.
(Independence theorem, [19].)
Let be . Then if , , , and , there is some with for .
Conant-independence was introduced in a modified form in [35] to show that theories were . The standard version was defined in [36], based on Conant’s implcit use of the concept in [11] to classify modular free amalgamation theories. It was proposed by the author of this paper as an extension of Kim-independence beyond theories.
Definition 2.3.
Let be a model and a formula. We say Conant-divides over if for every invariant Morley sequence over starting with , is inconsistent. We say Conant-forks over if and only if it implies a disjunction of formulas Conant-dividing over . We say is Conant-independent from over , written , if does not contain any formulas Conant-forking over .
In [36] it is shown that if Conant-independence is symmetric in a theory , is . In the same paper, Conant-indepedence is characterized for most of the known examples of theories, where it is shown to be symmetric. It is open whether Conant-independence is symmetric in all theories, or even all theories. It is also open whether theories with symmetric Conant-independence display the classification-theoretic behavior characteristic of theories with a good notion of free amalgamation, first studied in [11] and later improved upon in [36]: either or , and either simple or .
In this paper, we will be interested in theories and how they differ from theories:
Definition 2.4.
Let . A theory is (that is, does not have the n-strong order property) if there is no definable relation with no -cycles, but with tuples with for . Otherwise it is .
We will need nothing about , other than that the below counterexamples to our results on theories are , because they are free amalgamation theories; see [11], Theorem 4.4. We will need the following syntactic fact about , proven independently by Malliaris (Conclusion 6.15, [33]) and Conant ([11], Proposition 7.2 and proof of Theorem 7.17):
Fact 2.4.
Suppose there is an array and formulas , with
(1) For , is consistent.
(2) For , is inconsistent.
Then is .
Finally and -- will play a secondary role in this paper, but we will discuss some results on these classes that motivate our main results on theories.
Definition 2.5.
A theory is (that is, does not have the tree property of the second kind) if there is no array and formula so that there is some fixed so that, for all , is inconsistent, but for any , is consistent.
The class was introduced in [3] and further developed in [4] as a generalization of ; it has been proposed as one possible answer to a question of Kruckman [26], on what class can be viewed to generalize properties of and theories the same way theories generalize properties of and simple theories. It is still open to what extent the analogy holds; for example, whether Kim-forking coincides with Kim-dividing in theories, as forking coincides with dividing in theories. However, for -- theories, introduced in [35] and further developed in [25], the equivalence of Kim-forking and Kim-dividing was proven in [25] after being proven for coheir Kim-dividing and coheir Kim-forking in [35].
Definition 2.6.
(Proposition 2.51, item IIIa, [102]). A list is a descending comb if and only if it is an antichain so that , and so that, for ,
Definition 2.7.
The theory has - if there exists a formula and tuples so that is -inconsistent for any , but for any descending comb , is consistent. If does not have - for any , it has --.
3. Reflection principles for hypergraph sequences
Simple types were defined in [16]; then co-simple and types were defined in [8]. We define co- types and give some equivalent definitions, similarly to Definition 6.7 of [8]. (When clear from context, when is an -type we refer to by .
Definition 3.1.
A partial type over is co- if it satisfies one of the following equivalent conditions:
(1) There does not exist a formula and tuples , so that is consistent for any , but for any , is inconsistent.
(2, 2’) There does not exist a formula and an array , , so that is consistent, is -inconsistent for some (-inconsistent), and for each .
(3) Kim’s lemma for Kim-dividing: For , and , if Kim-divides over for , then for every -invariant Morley sequence with , is inconsistent.
Proof.
This is essentially proven in Chernikov and Ramsey, [10], and Kaplan and Ramsey, [19], so we will only give a sketch.
(1 2 2’) Follows from the proof of Proposition 2.4 of [10] uses the proof of Proposition 5.6 of [10]) The part due to [10] shows that if there is a formula and tuples , so that is consistent for any , but for any , is inconsistent, then there is an array , so that is consistent, is -inconsistent, and for each . The other direction due to [19] shows that if there is and , so that is consistent, is -inconsistent for some , and for each , then there is a formula (obtained as a conjunction of instances of ) and tuples , so that is consistent for any , but for any , is inconsistent. And if each for a fixed partial type, the former direction even shows that we can choose , and vice versa for the latter direction, proving the equivalence in the co- case.
(3 2). This is basically the proof of Proposition 3.14 of [19]. Assume (2) is false; we show (3) is false. The equivalence (1 2) does not use anything about the fact that is a model, and the failure of (1) to hold is preserved under expanding the language; therefore, we can fix a Skolemization of , and assume that for each . By Ramsey’s theorem and compactness, we can choose -indiscnernible in . Let . Choose non-principal ultrafilters , , containing , and let the global types , so that each of the are finitely satisfiable over . It can be shown from that ; let realize this, so . Then will be consistent for a Morley sequence in , but will be consistent for a Morley sequence in , so Kim’s lemma fails.
(2 3). This is the proof of Proposition 3.15 of [19]. We assume that (3) is false and show that (2) is false. Let for Kim-divide over , winessed by a Morley sequence in the -invariant type . Let Morley sequences in the -invariant type fail to witness Kim-dividing of over . Find so that . Then will be as desired.
While Chernikov ([19], Defintion 6.7) gives an additional characterization of co-simplicity in terms of symmetry for forking-independence, it requires additional elements of the base to belong to . Giving a characterization of co- types in terms of symmetry for Kim-independence would be more complicated, because defining Kim-independence over arbitrary sets, rather than models, requires additional considerations; see [19]. However, co- types over do have a symmetry property over , which will be useful in the sequel:
Proposition 3.1.
(Symmetry) Let be a co- type over and . If , then .
Proof.
Because is not necessarily contained in construction of the original tree must proceed like the proof of Theorem 5.4 of [35] (based in turn on the proof of Lemma 5.11 of [19]) in taking a specially chosen Morley sequence at each stage, rather than directly following the proof of Theorem 6.5 of [19]. Though the rest of the proof can be done as in Lemma 5.12 and Proposition 5.13 of [19], we give our own exposition, which only requires us to construct a tree of countable size rather than a much larger tree.
Suppose is co-. We begin with the following claim (which we could have avoided by following Lemma 5.12 and Proposition 5.13 of [19]):
Claim 3.2.
Let Kim-divide over for and . Then there is a bound depending only on and on the size of a set , for , so that there are -finitely satisfiable types so that for , and is consistent.
Proof.
This proceeds as in the direction (2 3) of the previous definition (again, see [19], Proposition 3.15). Let be as in the claim, and let Morley sequences in the -invariant type witness Kim-dividing of over : for , is -inconsistent for some fixed . Find so that . Then , so is consistent. However, , so is -inconsistent. Finally, for all , and , so for all .
Now if is unbounded ( is fixed) this contradicts Defintion 3.1 (2), by compactness.
∎
The following step, where we construct a tree, is where we must deviate from the proof of Theorem 5.16 of [19]. We use the notation to denote that there is a coheir Morley sequence over with that remains indiscernible over . We prove some basic facts about this relation:
Claim 3.3.
Right extension: The relation satisfies right extension: if , for any there is some with .
Proof.
Let be a Morley sequence in the -finitely satisfiable type , , that remains indiscernible over . By left extension for there is some -finitely satisfiable type extending and . Then there are , , so that is a Morley sequence in . By Ramsey’s theorem, compactness and an automorphism, can then be chosen so that , indeed so that , and is indiscernible over .
∎
Claim 3.4.
Chain condition: Let be an -finitely satisfiable Morley sequence indiscernible over . Then .
Proof.
By compactness there is so that and is indiscernible over . Then will be an -finitely satisfiable Morley sequence starting with and indiscernible over .
∎
Assume for contradiction that with , but . We find, for all , a tree , with the first levels forming an infinitely branching tree, then with each for at level followed by a single additional leaf at level , with the following two properties:
(1) For , , .
(2) For , the subtrees at form an -finitely satisfiable Morley sequence indiscernible over (so for this sequence of subtrees, .)
For , let , ; then (2) follows from the fact that easily implies . Assume already constructed; we construct . We see by (2) that for the nodes of the tree excluding , . By Claim 3.3, find with , which will be the new root of . Then find some -finitely satisfiable Morley sequence starting with indiscernible over , giving the subtrees of at . From , we will preserve (1) by indexing accordingly, and from choice of , we will preserve (2) as well.
We now find a contradiction to Definition 3.1.2; this is where, by constructing a much larger tree, we could have just followed Lemma 5.12 and Proposition 5.13 of [19]. By (1), the paths of each are consistent: for , is consistent, realized by . But by (2), for any nodes , forming an antichain so that , and so that, for , , form a sequence with ; by (1), . So for the bound from Claim 3.2, and with these conditions (forming a descending comb, Definition 2.6), for for satisfying the above property, is -inconsistent. So by compactness, we can find a tree with the same consistency and inconsistency properties for (consistency along the paths and inconsistency on descending combs of size ), and with .
We recall the following defintion and fact:
Definition 3.2.
(Definitions 11 and 12, [41]) For tuples of elements of , we write to mean that has the same quantifier-free type in the language as . For a tree-indexed set of tuples and an -tuple of elements of , we write , and call strongly indiscernible over a set if for all tuples of elements of with , .
Fact 3.5.
(Theorem 16, [41]; see [37] for an alternate proof) Let be a tree-indexed set of tuples, and a set. Then there is strongly indiscernible over so that for any tuple of elements of and , if for all , then .
Now use Fact 3.5 to extract a strongly indiscernible tree . Let . Then is as in Defintion 3.1.2, contradiction.
We could likely have also proven Proposition 3.1 in the style of Definition 6.1 of [8]: use right extension to find an -Morley sequence of over , indiscernible over , and then developed local character and Kim’s lemma for -Morley sequences in the context of co- types, [21] and [20]. Since these characterizations of co- are not necessary for our main theorem on internally types, we leave the details to the reader.
Notions such as co-simple and co- types involve interaction of the types with the rest of the structure. In the other direction, there are the simple types defined in [16], the and types defined in [8], and the fully stable types defined in [39]. We introduce a new schema for defining the local classification-theoretic properties of a type, which is in some sense more natural, because it depends only on the corresponding properties for a structure associated with the type.
Definition 3.3.
(1) Let be a partial -type over . Let contain an -ary relation symbol for each formula with for . Then is the -structure with domain and with .
(2) Let be a property of theories. Then a partial type is internally if the theory of is .
Theorem 6.17 of [8] says that simple types are co-simple; in fact, only internal simplicity is needed. By way of analogy, internally types are co- in - theories; see below. Beyond this analogy, we find that:
Theorem 3.7.
Let be , and an internally type. Then is co-.
Example 3.8.
Theorem 3.7 becomes false if we relax to . Let be the model companion of (undirected) triangle-free tripartite graphs, with the partition denoted by unary predicates . Let be a model and . Then is , in fact a free amalgamation theory in the sense of Conant ([11]). Moreover, is internally , in fact, internally simple. The associated theory has quantifier elimination in the language with unary predicates for , , denoting for each , and a binary relation symbol for the edge relation between elements of and elements of . It is the model companion of graphs with interpretations for the unary predicates and , so that and partition the graph and have no edges within them, there are no edges within for any , and are disjoint for with , and for is disjoint from when . In this form, the theory associated to can be easily seen to be simple (for example, check that the relation coincides with forking-independence).
However, is not co-: let . For , choose with, for any , , for and , and if and only if and are incomparable. This is possible, as we create no triangles. But , witness the failure of definition 3.1.1.
We prove Theorem 3.7. Again following the arguments of Chernikov and Ramsey [10] and Kaplan and Ramsey [19], we start by carrying out the arguments of Definition 3.1, (1 2’ 3 (for -Kim-dividing)) internally to . Since the consistency in the defintion of (1) need not be witnessed by a realization of , we will no longer be dealing with actual consistency or inconsistency of instances of , but rather the definable relations in corresponding to this consistency, treated only as a definable hypergraph. This hypergraph will be part of the characteristic sequence of , introduced by Malliaris in [30].
Suppose is not co-. Let , , be as in Defintion 3.1.1. By compactness, we can replace with , for large . Define . Then for , but for any , .
For a sequence of relations on a set, where is an -ary relation, call a sequence a clique if for , , and an -anticlique if for , . Choose a Skolemization of . We show that there is an array , , so that is a clique, is a -anticlique, and for each . We may follow the proof of [10], Proposition 5.6, that we cited in the direction (1 2’) of Definition 3.1. We sketch the argument: we will draw the from . Suppose that, for , and are already chosen to satisfy these properties, with and , for . Then using the pigeonhole principle, choose nodes , for so that and are such that .
We next find a model of the theory of and -invariant Morley sequences in the -invariant type and in the -invariant type , so that , is a clique, and is a -anticlique. As in the proof of (3 2) of Definition 3.1, we follow the proof of Proposition 3.14 of [19]. By Ramsey’s theorem and compactness, we can choose indiscernible in the theory of . Let , and let be sufficiently saturated. Choose non-principal ultrafilters , , containing , and let the global types , so that each of the are finitely satisfiable over . It can be shown from that ; let realize this. Then we can choose so that a -Morley sequence with is a clique, and a -Morley sequence with is a -anticlique.
Finally, we show, using the technique of Theorem 7.17 of [11], that the have the compatible order property (), Definition 3.10 of [30]. By compactness and Fact 2.4, the following will translate into an instance of in , a contradiction. We find an array , with the following properties:
(1) For , form a Morley sequence in , so a clique.
(2) For , begin a Morley sequence in , so .
(3)
Suppose we have constructed satisfying these properties up to . We find . To find , let so . By (3), . Finally, if , by symmetry of Kim-independence, Fact 2.2, . So by the independence theorem (fact 2.3) and an automorphism, there is with . Finally choose . It remains to show that this preserves (3). This follows from the following claim:
Claim 3.9.
For any , , if and extends to an -invariant type , then .
This follows from Claim 5.13 below, using the fact that in the language of that claim (Kim’s lemma, Fact 2.1, and compactness) and symmetry of (Fact 2.2).
This concludes the proof of Theorem 3.7.
This proof can be viewed as an instance of a more general phenomenon. In this proof, the are the restriction to of the characteristic sequence of , defined by Malliaris:
Definition 3.4.
([30]
Let be a formula. The characteristic sequence of is the sequence of hypergraphs, on the vertices , defined by
|
|
|
On the other hand, within , the are just a sequence of hypergraphs, and do not describe a pattern of consistency internally to . Nonetheless, by showing that a particular configuration, the compatible order property, arises among the , we get a description of the complexity of in the original theory . In [30], Malliaris introduces some hypergraph configurations corresponding, via the characteristic sequence, to consistency patterns (in the sense of [15]) in a first-order formula. We introduce some additional defintions to cover the case of the tree property, -, and ; the first of these comes from Observation 5.20 of [30].
Definition 3.5.
Let be a sequence of hypergraphs on a common set of vertices , where is an -ary edge relation Then has
(1) An -array if there is an array so that there is some fixed so that, for all , is a clique, but for any , is a -anticlique. (Definition 3.4.2, [30]. By Claim 3.8, [30], is equivalence to the presence of an -array in the characteristic sequence of a formula.
(2) The compatible order property if there are so that for , form a clique, while for , . (Definition 3.10, [30]. In Conclusion 6.15 of [30], is shown to be equivalent to the compatible order property in the characteristic sequence of a formula.)
(3) if there is some fixed and parameters so that for each path , is a clique, but for each node , is a -anticlique. (In Observation 5.10 of [30], the failure of a formula to be simple is observed to be equivalent to in the characteristic sequence.
(4) if there are parameters so that is a clique for any , but for any , is a -anticlique.
(5) - if for some fixed , there are parameters so that is a -anticlique for any , but for any descending comb , is a clique.
Note that these properties are all graph-theoretic in the sense of Malliaris, [30], referring only to incidence patterns of the edges, rather than their consistency. They are similar in this sense to stability or , which make no reference to consistency but only ask for graph-theoretic configurations. In [38], Shelah shows the following:
Fact 3.11.
Let be an unstable formula, and assume that all Boolean combinations of instances of are . Then has the independence property.
Note that the form of this result is as follows: if a graph has one graph-theoretic configuration (instability), and an ambient model-theoretic tameness property (, indeed quantifier-free ), then it has a more complicated graph-theoretic configuration (the independence property). It was Malliaris who first implicitly asked, in the context of strengthenings of the compatible order property (Remark 7.12, [31]), whether ambient classification-theoretic properties imply further graph-theoretic complexity gaps for hypergraphs. In the remainder of this section, we observe that model-theoretic tameness properties of hypergraph sequences that refer to consistency, such as simplicity and , provide additional information about their graph-theoretic structure, just as Shelah shows a gap between simplicity and independence in graphs. We then further observe that the connection between internal properties of types and external properties of theories, including the aforementioned work of Chernikov on co-simplicity ([8]), can be reinterpreted in terms of these graph-theoretic complexity gaps for model-theoretically tame hypergraphs.
Proposition 3.12.
Let be sequence of hypergraphs on a common set of vertices , where is an -ary edge relation.
(1) If is simple (in the hypergraph language) and has , it has an array.
(2) If is and has , then it has - and the compatible order property.
In fact, for (1), it suffices that no quantifier-free formula has the tree property, and similarly for (2) and .
Example 3.13.
If is the model companion of the empty theory in the language of hypergraph sequences (or, say, the theory axiomatizing the basic properties of characteristic sequences; see [30], Observation 2.4), then it is a simple structure. But it has - and the compatible order property.
Proof.
(Sketch)
The argument for (1) is extracted from Chernikov’s proof in [8] that simple types are co-simple. In particular, we notice that the proof Lemma 6.13 of [8] works when the rows are general indiscnernible sequences, not just Morley sequences, and relies only on the internal simplicity of a type, not the full definition of a simple type. Suppose has , but is simple as a structure in the language of hypergraph sequences. By the proof, which can be found in a standard reference on simplicity theory such as [22], that formulas with the tree property fail Kim’s lemma for dividing, there is a model of the theory of , some element of the monster model, and some indiscernible -anticlique starting with , as well as a Morley sequence starting with and forming a clique. Now suppose, by induction, that for there are are with and (so the are anticliques), so that for , is a clique, and so that . By properties of independence in simple theories, . By the chain condition, take , , with so that is indiscnernible over , and with . This suffices for the induction. Now the existence of an -array follows.
For (2), suppose is in the hypergraph language, but has . Then as in the proof of Theorem 3.7, there is a model of the theory of and there are -invariant Morley sequences in the -invariant type and in the -invariant type , so that , is a clique, and is a -anticlique. To show -, it suffices to find a tree so that the paths, read downward, are Morley sequences in , and the descending combs are Morley sequences in . Formally, the construction will follow [35], Lemma 4.5. Say that a tree is a generic tree if for (two subtrees at a node are Kim-independent), and (each node satisfies the restriction of to its subtrees.) We prove the following claim (corresponding to Claim 4.6 of [35]):
Claim 3.14.
Let be a generic tree, and any set. Then there is some with for each , and with .
Proof.
By induction on , we may assume this is true for and . Namely, fin with for each and , and similarly, with for each and . Recall that as is a generic tree, so by the independence theorem and an automorphism, we can find with for each and . Finally, by the independence theorem and an automorphism, find so that , as desired.
∎
By induction, we construct a generic tree so that the paths, read downward, are Morley sequences in , and the descending combs are Morley sequences in . Suppose we have constructed with these properties. By Claim 3.14, we can find with and for , , for . The trees and of height will be the subtrees of our new generic tree of height . Finally, let be the new root. Reindexing accordingly, we get a generic tree so that the paths, read downward, are Morley sequences in , and the descending combs are Morley sequences in . This completes the induction.
Now the compatible order property comes from the proof of Theorem 3.7.
We connect this to the internal properties of types. We recall the defintion of co-simplicity from [8]:
Definition 3.6.
A type over is co-simple if there is no formula , and parameters , so that for each path , is consistent, but for each node , is -inconsistent.
Corollary 3.14.1.
(1) ([8], Theorem 6.17) In a theory, internally simple types are co-simple.
(2) In an -- theory or an theory, internally types are co-
Proof.
(1). If is not co-simple then the restriction of some charcateristic sequence to has . If is internally , then is , so by the previous proposition it has an array. So must have .
(2). If is not co- then the restriction of some charcateristic sequence to has . If is internally , then is , so by the previous proposition it has - and the compatible order property. So must have - and .
∎
In other words, the fact that internally types are co- in theories can be interpreted as saying that in an theory, the graph-theoretic complexity of a characteristic sequence must be reflected in its model-theoretic complexity in the hypergraph language.
4. Independence of internally types in theories
In this section, we prove an extension of the independence theorem of Kaplan and Ramsey ([19]) to internally types in theories. We will use Theorem 3.7, namely that internally types in theories are co-.
While the theorem does not give , can be chosen so that any two of is Conant-independent from the third, somewhat similarly to Theorem 2.13 of [27].
Theorem 4.1.
Let be , and let be internally types over . Let , , . If , , , there is some with . Moreover, can be chosen with , and .
It is of interest that the conclusion does not hold for theories, nor does it follow from co-.
Example 4.2.
Let be the model companion of the theory of triangle-free tripartite graphs, with the partition denoted by as in Example 3.8. Recall that is , and is a free amalgamation theory in the sense of [11], so if and only of ; see Proposition 4.3 of [36]. Let for . Then the are internally stable–the structures have quantifier elimination in the unary language of -definable subsets of . Internally stable types are always co-: by the proof of Theorem 3.7, if an internally stable type is not co-, then in the theory of , there is a hypergraph sequence , a model , and Morley sequences and with so that is a clique and is an anti-clique. But this is impossible if the theory of is stable, as implies when and are Morley sequences in a stable theory.
However, the conclusion of theorem 4.1 does not hold. Let , , with , , . Then , , , but is inconsistent.
We prove theorem 4.1, beginning with some observations on co- types. First of all, Conant-independence between co- types is just Kim-dividing independence.
Claim 4.3.
If for a co- type over , then if and only if .
Proof.
If , then by Kim’s lemma, Definition 3.1.3. Conversely, if , then in particular, by compactness we can choose an -finitely satisfiable Morley sequence , , that is indiscernible over . But then, by Fact 5.7 below, formulas that do not Kim-divide over by a some -finitely satisfiable Morley sequence do not Conant-fork over , so .
∎
Claim 4.4.
If are co- types over and , , then if and only if .
This follows from Proposition 3.1.
Claim 4.5.
If for a co- type over , and , then for any -finitely satisfiable type , there is a Morley sequence in , , that is indiscernible over , and any such Morley sequence will satisfy .
This is the “chain condition”, Claim 3.4, together with compactness. We use Claims 4.3-4.5 throughout.
Third, we have the weak independence theorem between two co- types, analogously to Proposition 6.1 of Kaplan and Ramsey, [19]:
Claim 4.6.
Let be co- types over , and let , , , , . Then there is with .
Proof.
The proof is similar to Proposition 6.1 of [19]. By Claims 4.4 and 4.5 and , let be an -invariant Morley sequence with that is indiscernible over . Again by Claims 4.4 and 4.5., and , for , is consistent, so we can choose some . By Ramsey’s theorem, compactness and an automorphism, we can choose in particular so that remains indiscernible over . So , and , with .
Let be an -finitely satisfiable type extending , and let , so and . As , choose with ; by left extension for , can further be chosen with . Then begin an -invariant Morley sequence . As , there is an -invariant Morley sequence indiscernible over ; using claim 4.5, . Write . Then , and . By an -automorphism taking to , we obtain as desired.
Using this weak independence theorem, we can now show the full independence theorem between two co- types.
Claim 4.7.
Let be co- types over , and let , , , , . Then there is with .
Proof.
We could have followed the proof of Theorem 6.5 of [19], but we offer our own exposition. We first show that it suffices to show consistency of in the statement of Claim 4.9. Let be an -finitely satisfiable type extending . By Claims 4.4 and 4.5, we can find with indiscernible over and with indiscernible over , both -finitely satisfiable Morley sequences in . Then . So using the consistency, we can find , which by Ramsey’s theorem and compactness, can be assumed indiscernible over . So by claim 4.4, and we can find in this sequence as desired.
Therefore, suppose are as in the statement of the claim, and is inconsistent. By compactness, there are some and with inconsistent. Let . We find , with the following properties
(1) For , for , and for . Thus by repeated applications of Claim 4.9, is consistent.
(2) For , , so is inconsistent.
(3) .
By Fact 2.4, this will give us a failure of co-, a contradiction. We use the technique of Conant, [11] (though it is not yet necessary to get ; this technique is similar to the “zig-zag lemma,” Lemma 6.4, from the original proof of the independence theorem in [19]). Assume already constructed, satisfying these properties up to (including ). By repeated instances of Claim 4.9 (applied to ), and , there is with . Again by Claim 4.9, , and an automorphism, we can additionally choose so that and . Now choose with . We get , by the proof of Claim 5.13.
∎
We first show that the “moreover” clause follows from the conclusion. Let , , be as in the hypotheses of the theorem. As , by Claims 4.3 and 4.5, there is an -finitely satisfiable Morley sequence with that is indiscernible over and . Likewise, there is an -finitely satisfiable Morley sequence with that is indiscernible over and with . By and an automorphism, we can find with and indiscernible over , so we can assume and is indiscernible over . Similarly, we can assume and is indiscnernible over . Fix an -finitely satisfiable type extending . Then there is a Morley sequence in with , and indiscernible over . There is also a Morley sequence in with , and indiscernible over . Since the Morley sequences were chosen to be in the same -finitely satisfiable type, . So applying the consistency part of the theorem, we can find . For , , . We apply the following case of Lemma 1.2.1 [8]:
Fact 4.8.
Let , , be indiscernible sequences over . Then there are mutually indiscernible , , , (i.e. each indiscernible over ) so that for any formula , if for all with , , , , then for all such ,
Let , , be as in Fact 4.3. Then , , and , and , , . So by an automorphism, we find as desired in the “moreover” clause.
We finally show the actual consistency part of the theorem. Let , , . By an automorphism, it sufficies to show that is consistent. This will require ; formally, we will use the technique of Evans and Wong, from Theorem 2.8 of [14]. Call , , a generic triple if there are mutually indiscernible -invariant Morley sequences with , with , with ; note that it follows that , and are pairwise Conant-independent.
Claim 4.9.
Let , , be a generic triple, and such that . Then there is some with so that form a generic triple.
Proof.
Let , , be as in the definition of a generic triple.
Subclaim 4.10.
There is and with so that forms an invariant Morley sequence over and .
Proof.
Let be a Morley sequence in the -invariant type . Chose an -invariant type extending . By an automorphism, there is so that, for , . So is an -invariant Morley sequence. Let ; then . Finally, we show that . Suppose by induction that Note that extends to an -invariant type, and also extends to an -invariant type. By the proof of Claim 5.13 below, we see that for any sets of realizations of a common co- type over , if and extends to an -invariant type , then . So by two applications of this fact and symmetry (claim 4.4), . This completes the induction, from which it follows that .
∎
Let be as in the subclaim. As , for , by claim 4.5 and an automorphism there is with . By claims 4.4 and 4.5, we can then find indiscernible over with and . So we have and , by indiscernibility of over and claim 4.5, and by the subclaim. So by the independence theorem between two co- types (Claim 4.7) and an automorphism, there is some with and . The sequence will have the following three properties: , so , for , form an -invariant Morley sequence, and for . If we extract mutually indiscernible sequences from , finding as in Fact 4.8, then , so we may assume , , and then will also have these three properties that has. Let . Then , and will be mutually indiscernible -invariant Morley sequences, so form a generic triple.
∎
Now we find , , and with the following properties:
(1) For , , , .
(2) For , , , and
(3) For each , , form a generic triple.
Assume , , already constructed, satisfying these properties up to . As for , , we can find some with , by, say, repeated applications of the independence theorem between two co- types, Claim 4.7 (though could have stated the claim so that we need less than this). Then letting , , , we can choose as in Claim 4.9, while will be as desired. Symmetrically, we find and .
|
|
|
By (1) this has infinite chains, so by and compactness it has a -cycle: some
|
|
|
|
|
|
In particular, , as desired. This concludes the proof of Theorem 4.2.
5. theories with symmetric Conant-independence
In [40], Simon proves the following independence theorem for theories, using the independence theorem for theories of Ben Yaacov and Chernikov ([42]).
Fact 5.1.
Let be , and let and . Let with . Then there is some with and .
(In fact, Simon proves a more general version of this over extension bases.) He then poses the question
Question 5.2.
Suppose and are -invariant types in an theory with , and let be small supersets of . For some/every so that , is there with ?
This is true for simple theories by the independence theorem for simple theories ([24]), and for NIP theories because determines any invariant type (Proposition 2.36 of [39]); fact 5.1 justifies the equivalence of “some” with “any” . We show that a similar property holds for finitely satisfiable types in theories with symmetric Conant-independence:
Theorem 5.3.
Let be an theory, and assume is symmetric. Suppose and are -finitely satisfiable (global) types with , and let be small supersets of with . Then there is with
The “some” part, the analogue of a positive answer to Question 5.2, will be supplied by the symmetry of Conant-independence. Then the “every” part, correspnding to Fact 5.1, will follow from . Before proceeding, we will show this fails for theories with symmetric Conant-independence.
Example 5.4.
The model companion of the theory of triangle-free graphs has and symmetric Conant-independence; see [36]. If is a nonalgebraic -finitely satisfiable type, is determined by : By indiscernibility, for , as for all is impossible.
Next, we claim that, if is countable, for the complete type over containing for all , there are -finitely satisfiable types and extending , and for , , so that there is no with . Let enumerate the set of subsets of defined by -formulas in . We choose, by induction, disjoint anticliques , of , both of which meet each of the . Namely, we construct disjoint anticliques for , so that and for and and for , and take and . Suppose already constructed. Since is defined by a conjunction of formulas of the form and for , and is a model of the model companion of the theory of triangle-free graphs, we can find distinct so that for any , for , and take and . Now let be an ultrafilter containing and be an ultrafilter containing . Let . Let be such that, for , if and only if , and similarly for and . This is possible because and are anticliques. Then , , , are as desired in the claim.
There is an invariant type extending so that, for , ; for example, we can require that if and only if or . This gives a consistent type: let be a node satisfying these relations in a graph extending ; then there are no triangles involving , a realization of in , and an element of , because we chose and to be disjoint; there are also no edges between realizations of in , because is nonempty and there are no triangles in , so there are no triangles involving and two realizations of in . Let ; then and .
But is inconsistent.
We first study theories where Conant-independence is symmetric. Naïvely, one expects it to follow from compactness that implies the existence of an -indiscernible -invariant Morley sequence starting with . This naïve argument fails, because the property of being an invariant Morley sequence of realizations of a fixed complete type over is not type-definable. However, the following proposition about theories with symmetric Conant-independence is enough for our purposes:
Lemma 5.5.
Suppose is symmetric, and let be a coheir Morley sequence over with that is indiscernible over . Then there is an -invariant Morley sequence with that is indiscernible over .
Proof.
The main claim of this proof is the following;
Claim 5.6.
There exists with so that remains indiscernible over .
Proof.
We first show that . We need the following fact:
Fact 5.7.
(Fact 6.1, [36])
Let be a coheir Morley sequence over with so that is consistent. Then does not Conant-fork over .
Now suppose for . Then for is a finitely satisfiable Morley sequence over with so that is consistent, so by the fact, does not Conant-fork over and is as desired. (See the proof of Proposition 5.3 of [35], or Proposition 3.21 of [19].)
Let . By symmetry, , so for every , there is some with so that is consistent. By compactness, the condition is type-definable over (contrast with the remark on invariant Morley sequences in the paragraph immediately preceding the proof of the proposition), so there is with so that is consistent. By an automorphism, we can assume , and by Ramsey’s theorem and compactness (and an automorphism), we can assume is indiscernible over .
We now show by induction that we can find for , large, so that , , , and is indiscernible over for . Suppose we have found for and we find : By the claim, there are with and indiscernible over . Now let .
Then by the Erdős-Rado theorem, we can find an -indiscernible invariant Morley sequence sequence over starting with , which will in particular be -indiscernible.
Lemma 5.9.
Assume is symmetric. Let and be -finitely satisfiable types with , and let be small sets containing . Then there is some - invariant type so that, for any with and , is consistent.
Proof.
(See also the proof of Proposition 5.7 of [35], or Proposition 6.10, [19].) Let . By an automorphism, there is an -saturated model so that , and also by an automorphism, there is some with . By Ramsey’s theorem and compactness, we can assume is indiscernible over ; now let for . By lemma 5.5, there is an -invariant type and a Morley sequence with in that is indiscernible over . In particular, is consistent, realized by . Let ; then for , is consistent. Let have for , and . By -saturation of , there are with . Let . Then is consistent. But by invariance, . So is consistent, as desired.
∎
We are now ready to prove Theorem 5.3. First of all, replacing with and with , we may assume that is the type of a coheir Morley sequence over . Now assume is consistent, realized by a coheir Morley sequence . It can be assumed indiscernible over by Ramsey’s theorem and compactness, so by the paragraph immediately following Fact 5.7, and by symmetry. So it suffices to show is consistent. Suppose otherwise, so there are and such that is inconsistent. Let , and let be as in lemma 5.9. Once again, we use Conant’s technique, Theorem 7.17 of [11]. By induction, we will find so that
(1) For , , so is inconsistent and for each .
(2) For , , so and in particular is consistent by lemma 5.9.
Assume have already been constructed satisfying (1) and (2) up to . Then begin an invariant Morley sequence in , so because , is consistent, and we can take to realize it. Then we can take .
By 2.4, properties (1) and (2) imply –a contradiction. This proves Theorem 5.3.
Symmetry of is not used directly in building the configuration satisfying (1) and (2); this is in contrast to [35], where the rows are required to be (coheir) Conant-independent throughout the construction. We now prove a version of Theorem 5.3 for Kim-nonforking types over rather than finitely satisfiable or invariant types over , that uses the full force of the assumption that the relevant independence relation, in this case , is symmetric.
By remark 5.8, in an theory where Conant-forking coincides with Conant-dividing and is symmetric, Theorem 5.3 holds even if and are only assumed to be -invariant types with , rather than -finitely satisfiable types. In this case, and are examples of types, so that for any small , there are -invariant Morley sequences and , so that and for , , and (and ). This assumption can be seen as an analogue of for Kim-nonforking types over , and yields the conclusion of Theorem 5.3 with respect to :
Theorem 5.10.
Assume is symmetric and is . Let be an -invariant type, be small supersets of with and , -invariant Morley sequences in indiscernible over and respectively, with . Then there is some with and . If (resp. ) satisfies the chain condition, the assumption can be relaxed to (resp. ).
Note that is known to satisfy the chain condition in theories (Proposition 2.8, [42]). It is not known whether there are non-simple examples of theories. (Problem 3.16, [8]).
We start with the analogue of lemma 5.5.
Lemma 5.11.
Let , , , , , be as in the statement of Theorem 5.10, and assume is symmetric. Let and . Then there is some invariant type so that for with for beginning an invariant Morley sequence over and , is consistent.
Proof.
Let enumerate the invariant Morley sequences in . Since , is consistent for any invariant Morley sequence in , so by automorphisms, there are so that for and , for , . Let . By another automorphism, find with . Then by Ramsey’s theorem and compactness, can be assumed indiscernible over . By remark 5.8, there is an -invariant type and a Morley sequence with in that is indiscernible over .
In particular, for any , is consistent, realized by . Let ; then for , for any , is consistent. Let begin an invariant Morley sequence over with for , and . Then there are with . Let . Then is consistent. But by invariance, . So is consistent, as desired.
∎
We fix the auxilliary notation to mean that there is an -invariant Morley sequence with that is indiscernible over . By Remark 5.8, if is symmetric then so is . We prove the following lemma about and :
Lemma 5.12.
Let and . Then there is with and .
Proof.
(See also the proof of Proposition 5.7 of [35], or Proposition 6.10, [19].)
By , let with be an -invariant Morley sequence indiscernible over . By and compactness, there is some with for . By Ramsey’s theorem, compactness, and an automorphism, we can choose so that is indiscernible over , so : if is a Morley sequence in the -invariant type , then by compactness, there is a Morley sequence in with that is indiscernible over (See also the paragraph immediately following Fact 5.7). So by the paragraph immediately preceding the statement of the lemma, , and in particular there is with ; by Ramsey’s theorem, compactness, and an automorphism, we can choose so that is indiscernible over . Then, again, , so in particular, ; also, .
∎
We are now ready to prove Theorem 5.10. Note that if we can find so that and , then can be chosen indiscernible over , so , and . So it suffices to show is consistent. Suppose it is inconsistent. Then by compactness, there are some and so that is inconsistent. Let and let be as in Lemma 5.1. Let be large. By transfinite induction, we will find , so that
(1) For , , so is inconsistent and .
(2) For , and .
(3) For , .
Suppose already constructed satisfying (1)-(3) for . We find and . By , or or and the respective chain condition, since is an invariant Morley sequence in , there is some with . By Lemma 5.12, can then additionally be chosen with and , as desired. We then choose , which will preserve (1) and (2); it remains to show (3). This will follow from the following claim, analogous to Claim 6.2 of [35]:
Claim 5.13.
For any , , if and extends to an -invariant type , then . (This is true as long as is symmetric.)
Proof.
It follows that , so let be an -indiscernible invariant Morley sequence over with . By an automorphism, we can choose so that . By Ramsey and compactness, we can further choose indiscernible over , so and by symmetry of , .
∎
Finally, by the Erdős-Rado theorem, we can find indiscnernible over , satisfying (1) and (2) (and (3)). Then will be an invariant Morley sequence over with , so for , by (2) and Lemma 5.11, and therefore is consistent. This, together with (1), implies by fact 2.4 –a contradiction.
Acknowledgements The author would like to thank Hyoyoon Lee, Byunghan Kim, and the other participants of the Yonsei University logic seminar for their comments on the degree of Kim-dividing , and Nicholas Ramsey for bringing to the author’s attention Question 5.2 of Simon.