We prove that a theory T has stable forking if and only if Teq has stable forking.

We prove that for any simple theory which is constructed via Fräissé-Hrushovski method, if the forking independence is the same as the d-independence then the stable forking property holds.

We define a generalized notion of rank for stable theories without dense forking chains, and use it to derive that every type is domination-equivalent to a finite product of regular types. We apply this to show that in a small theory admitting finite coding, no realisation of a nonforking extension of some strong type can be algebraic over some realisation of a forking extension.

We discuss the role of weakly normal formulas in the theory of thorn forking, as part of a commentary on the paper [5]. We also give a counterexample to Corollary 4.2 from that paper, and in the process discuss “theories with selectors.”.

Let Δ be a set of formulas. In this paper we study the following question: under what assumptions on Δ, the concept “a complete Δ-type p over B does not fork over A ⊆ B” behaves well. We apply the results to the structure theory of ω1-saturated models.

An amalgamation base p in a simple theory is stably definable if its canonical base is interdefinable with the set of canonical parameters for the ϕ-definitions of p as ϕ ranges through all stable formulae. A necessary condition for stably definability is given and used to produce an example of a supersimple theory with stable forking having types that are not stably definable. This answers negatively a question posed in [8]. A criterion for and example of a (...) stably definable amalgamation base whose restriction to the canonical base is not axiomatised by stable formulae are also given. The examples involve generic relations over non CM-trivial stable theories. (shrink)

We investigate the geometry of forking for SU-rank 2 elements in supersimple ω-categorical theories and prove stable forking and some structural properties for such elements. We extend this analysis to the case of SU-rank 3 elements.

Shelah's theory of forking is generalized in a way which deals with measures instead of complete types. This allows us to extend the method of forking from the class of stable theories to the larger class of theories which do not have the independence property. When restricted to the special case of stable theories, this paper reduces to a reformulation of the classical approach. However, it goes beyond the classical approach in the case of unstable theories. (...) Methods from ordinary forking theory and the Loeb measure construction from nonstandard analysis are used. (shrink)

In a simple CM-trivial theory every hyperimaginary is interbounded with a sequence of finitary hyperimaginaries. Moreover, such a theory eliminates hyperimaginaries whenever it eliminates finitary hyperimaginaries. In a supersimple CM-trivial theory, the independence relation is stable.

We study the behaviour of stable types in rosy theories. The main technical result is that a non-þ-forking extension of an unstable type is unstable. We apply this to show that a rosy group with a þ-generic stable type is stable. In the context of super-rosy theories of finite rank we conclude that non-trivial stable types of U þ -rank 1 must arise from definable stable sets.

T is stable. We define the notion of meager regular type and prove that a meager regular type is locally modular. Assuming I < 2o and G is a definable abelian group with locally modular regular generics, we prove a counterpart of Saffe's conjecture. Using these results, for superstable T we prove the conjecture of vanishing multiplicities. Also, as a further application, in some additional cases we prove a conjecture regarding topological stability of pseudo-types over Q.

Inhibiting the progress of replication forks in E. coli makes them susceptible to breakage. Broken replication forks are evidently reassembled by the RecBCD recombinational repair pathway. These findings explain a particular pattern of DNA degradation during inhibition of chromosomal replication, the role of recombination in the viability of mutants with displaced replication origin, and hyper‐recombination observed in the Terminus of the E. coli chromosome in rnh mutants. Breakage and repair of inhibited replication forks could be the reason for the recombination‐dependence (...) of inducible stable DNA replication. A mechanism by which RecABCD‐dependent recombination between very short inverted repeats may help E. coli to invert an operon, transcribed in the direction opposite to that of DNA replication, is discussed. (shrink)

We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories (those where, in a precise sense, the cellular morphisms are generated by a set) are exactly those that give rise to stable independence notions. We give two applications: on the one hand, we show that the abstract elementary classes of roots of Ext studied by Baldwin–Eklof–Trlifaj (...) are stable and tame. On the other hand, we give a simpler proof (in a special case) that combinatorial categories are closed under 2-limits, a theorem of Makkai and Rosický. (shrink)

CM-triviality of a stable theory is a notion introduced by Hrushovski [1]. The importance of this property is first that it holds of Hrushovski's new non 1-based strongly minimal sets, and second that it is still quite a restrictive property, and forbids the existence of definable fields or simple groups (see [2]). In [5], Frank Wagner posed some questions aboutCM-triviality, asking in particular whether a structure of finite rank, which is “coordinatized” byCM-trivial types of rank 1, is itselfCM-trivial. (Actually (...) Wagner worked in a slightly more general context, adapting the definitions to a certain “local” framework, in which algebraic closure is replaced byP-closure, forPsome family of types. We will, however, remain in the standard context, and will just remark here that it is routine to translate our results into Wagner's framework, as well as to generalise to the superstable theory/regular type context.) In any case we answer Wagner's question positively. Also in an attempt to put forward some concrete conjectures about the possible geometries of strongly minimal sets (or stable theories) we tentatively suggest a hierarchy of geometric properties of forking, the first two levels of which correspond to 1-basedness andCM-triviality respectively. We do not know whether this is a strict hierarchy (or even whether these are the “right” notions), but we conjecture that it is, and moreover that a counterexample to Cherlin's conjecture can be found at level three in the hierarchy. (shrink)

The non‐forking‐instances topology (NFI topology) is a topology on the Stone space of a theory T that depends on a reduct of T. This topology has been used in [6] to describe the set of universal transducers for (invariants sets that translate forking‐open sets in to forking‐open sets in T). In this paper we show that in contrast to the stable case, the NFI topology need not be invariant over parameters in but a weak version of (...) this holds for any simple T. We also note that for the lovely pair expansions, of theories with the weak non‐finite cover property (wnfcp), the topology is invariant over in. (shrink)

The notion $J$ is independent in $(M,M_0,N)$ was established by Shelah, for an AEC (abstract elementary class) which is stable in some cardinal $\lambda$ and has a non-forking relation, satisfying the good $\lambda$-frame axioms and some additional hypotheses. Shelah uses independence to define dimension. Here, we show the connection between the continuity property and dimension: if a non-forking satisfies natural conditions and the continuity property, then the dimension is well-behaved. As a corollary, we weaken the stability hypothesis (...) and two additional hypotheses, that appear in Shelah's theorem. (shrink)

Let M be an arbitrary structure. Then we say that an M -formula φ defines a stable set inM if every formula φ ∧ α is stable. We prove: If G is an M -definable group and every definable stable subset of G has U -rank at most n , then G has a maximal connected stable normal subgroup H such that G /H is purely unstable. The assumptions hold for example if M is interpretable in (...) an o-minimal structure.More generally, an M -definable set X is weakly stable if the M -induced structure on X is stable. We observe that, by results of Shelah, every weakly stable set in theories with NIP is stable. (shrink)

We prove (Proposition 2.1) that if $\mu$ is a generically stable measure in an NIP (no independence property) theory, and $\mu(\phi(x,b))=0$ for all $b$ , then for some $n$ , $\mu^{(n)}(\exists y(\phi(x_{1},y)\wedge \cdots \wedge\phi(x_{n},y)))=0$ . As a consequence we show (Proposition 3.2) that if $G$ is a definable group with fsg (finitely satisfiable generics) in an NIP theory, and $X$ is a definable subset of $G$ , then $X$ is generic if and only if every translate of $X$ does (...) not fork over $\emptyset$ , precisely as in stable groups, answering positively an earlier problem posed by the first two authors. (shrink)

In the present paper we shall prove that countable ω-categorical simple CM-trivial theories and countable ω-categorical simple theories with strong stable forking are low. In addition, we observe that simple theories of bounded finite weight are low.

We develop a new notion of independence (þ-independence, read "thorn"-independence) that arises from a family of ranks suggested by Scanlon (þ-ranks). We prove that in a large class of theories (including simple theories and o-minimal theories) this notion has many of the properties needed for an adequate geometric structure. We prove that þ-independence agrees with the usual independence notions in stable, supersimple and o-minimal theories. Furthermore, we give some evidence that the equivalence between forking and þ-forking in (...) simple theories might be closely related to one of the main open conjectures in simplicity theory, the stable forking conjecture. In particular, we prove that in any simple theory where the stable forking conjecture holds. þ-independence and forking independence agree. (shrink)

Firstly, in this paper, we prove that the equivalence of simplicity and the symmetry of forking. Secondly, we attempt to recover definability part of stability theory to simplicity theory. In particular, using elimination of hyperimaginaries we prove that for any supersimple T, canonical base of an amalgamation class P is the union of names of ψ-definitions of P, ψ ranging over stationary L-formulas in P. Also, we prove that the same is true with stable formulas for an 1-based (...) theory having elimination of hyperimaginaries. For such a theory, the stable forking property holds, too. (shrink)

We study classes of modules closed under direct sums, [Formula: see text]-submodules and [Formula: see text]-epimorphic images where [Formula: see text] is either the class of embeddings, RD-embeddings or pure embeddings. We show that the [Formula: see text]-injective modules of theses classes satisfy a Baer-like criterion. In particular, injective modules, RD-injective modules, pure injective modules, flat cotorsion modules and [Formula: see text]-torsion pure injective modules satisfy this criterion. The argument presented is a model theoretic one. We use in an essential (...) way stable independence relations which generalize Shelah’s non-forking to abstract elementary classes. We show that the classical model theoretic notion of superstability is equivalent to the algebraic notion of a noetherian category for these classes. We use this equivalence to characterize noetherian rings, pure semisimple rings, perfect rings and finite products of finite rings and artinian valuation rings via superstability. (shrink)

The classes stable, simple, and NSOP $_1$ in the stability hierarchy for first-order theories can be characterised by the existence of a certain independence relation. For each of them there is a canonicity theorem: there can be at most one nice independence relation. Independence in stable and simple first-order theories must come from forking and dividing (which then coincide), and for NSOP $_1$ theories it must come from Kim-dividing. We generalise this work to the framework of Abstract (...) Elementary Categories (AECats) with the amalgamation property. These are a certain kind of accessible category generalising the category of (subsets of) models of some theory. We prove canonicity theorems for stable, simple, and NSOP $_1$ -like independence relations. The stable and simple cases have been done before in slightly different setups, but we provide them here as well so that we can recover part of the original stability hierarchy. We also provide abstract definitions for each of these independence relations as what we call isi-dividing, isi-forking, and long Kim-dividing. (shrink)

Journal of Mathematical Logic, Ahead of Print. We study classes of modules closed under direct sums, [math]-submodules and [math]-epimorphic images where [math] is either the class of embeddings, RD-embeddings or pure embeddings. We show that the [math]-injective modules of theses classes satisfy a Baer-like criterion. In particular, injective modules, RD-injective modules, pure injective modules, flat cotorsion modules and [math]-torsion pure injective modules satisfy this criterion. The argument presented is a model theoretic one. We use in an essential way stable (...) independence relations which generalize Shelah’s non-forking to abstract elementary classes. We show that the classical model theoretic notion of superstability is equivalent to the algebraic notion of a noetherian category for these classes. We use this equivalence to characterize noetherian rings, pure semisimple rings, perfect rings and finite products of finite rings and artinian valuation rings via superstability. (shrink)

We define a notion of residue field domination for valued fields which generalizes stable domination in algebraically closed valued fields. We prove that a real closed valued field is dominated by the sorts internal to the residue field, over the value group, both in the pure field and in the geometric sorts. These results characterize forking and þ-forking in real closed valued fields (and also algebraically closed valued fields). We lay some groundwork for extending these results to (...) a power-bounded T-convex theory. (shrink)

The study of classes of models of a finite diagram was initiated by S. Shelah in 1969. A diagram D is a set of types over the empty set, and the class of models of the diagram D consists of the models of T which omit all the types not in D. In this work, we introduce a natural dependence relation on the subsets of the models for the 0-stable case which share many of the formal properties of (...) class='Hi'>forking. This is achieved by considering a rank for this framework which is bounded when the diagram D is 0-stable. We can also obtain pregeometries with respect to this dependence relation. The dependence relation is the natural one induced by the rank, and the pregeometries exist on the set of realizations of types of minimal rank. Finally, these concepts are used to generalize many of the classical results for models of a totally transcendental first-order theory. In fact, strong analogies arise: models are determined by their pregeometries or their relationship with their pregeometries; however the proofs are different, as we do not have compactness. This is illustrated with positive results as well as negative results . We also give a proof of a Two Cardinal Theorem for this context. (shrink)

An intermediate stage in Hrushovski’s construction of flat strongly minimal structures in a relational language L produces ω-stable structures of rank ω. We analyze the pregeometries given by forking on the regular type of rank ω in these structures. We show that varying L can affect the isomorphism type of the pregeometry, but not its finite subpregeometries. A sequel will compare these to the pregeometries of the strongly minimal structures.

We introduce the notion of a lovely pair of models of a simple theory T, generalizing Poizat's “belles paires” of models of a stable theory and the third author's “generic pairs” of models of an SU-rank 1 theory. We characterize when a saturated model of the theory TP of lovely pairs is a lovely pair , finding an analog of the nonfinite cover property for simple theories. We show that, under these hypotheses, TP is also simple, and we study (...) forking and canonical bases in TP. We also prove that assuming only that T is low, the existentially universal models of the universal part of a natural expansion TP+ of TP, are lovely pairs, and “simple Robinson universal domains”. (shrink)

We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of ‘pure instability’ that we call ‘distality’ in which no such phenomenon occurs. O-minimal theories and the p-adics for example are distal. Next, we try to understand what happens when distality fails. Given a type p over a sufficiently saturated model, we extract, in some sense, the stable part of p and define a notion of stable independence (...) which is implied by non-forking and has bounded weight. (shrink)

In this paper we set out the basic model theory of differential fields of characteristic 0, which have finitely many commuting derivations. We give axioms for the theory of differentially closed differential fields with m derivations and show that this theory is ω-stable, model complete, and quantifier-eliminable, and that it admits elimination of imaginaries. We give a characterization of forking and compute the rank of this theory to be ω m + 1.

In this paper we study a specific subclass of abstract elementary classes. We construct a notion of independence for these AEC’s and show that under simplicity the notion has all the usual properties of first order non-forking over complete types. Our approach generalizes the context of 0-stable homogeneous classes and excellent classes. Our set of assumptions follow from disjoint amalgamation, existence of a prime model over 0/, Löwenheim–Skolem number being ω, -tameness and a property we call finite character. (...) We also start the studies of these classes from the 0-stable case. Stability in 0 and -tameness can be replaced by categoricity above the Hanf number. Finite character is the main novelty of this paper. Almost all examples of AEC’s have this property and it allows us to use weak types, as we call them, in place of Galois types. (shrink)

Fix a weakly minimal (i.e. superstable U-rank 1) structure M. Let M∗ be an expansion by constants for an elementary substructure, and let A be an arbitrary subset of the universe M. We show that all formulas in the expansion (M∗,A) are equivalent to bounded formulas, and so (M,A) is stable (or NIP) if and only if the M-induced structure AM on A is stable (or NIP). We then restrict to the case that M is a pure abelian (...) group with a weakly minimal theory, and AM is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of (Z,+). Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form (M,A). Most notably, we show that if (G,+) is a weakly minimal additive subgroup of the algebraic numbers, A⊆G is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of A is a root of unity, then (G,+,B) is superstable for any B⊆A. (shrink)

Building on Pierre Simon’s notion of distality, we introduce distality rank as a property of first-order theories and give examples for each rankmsuch that$1\leq m \leq \omega $. For NIP theories, we show that distality rank is invariant under base change. We also define a generalization of type orthogonality calledm-determinacy and show that theories of distality rankmrequire certain products to bem-determined. Furthermore, for NIP theories, this behavior characterizesm-distality. If we narrow the scope to stable theories, we observe thatm-distality can (...) be characterized by the maximum cycle size found in the forking “geometry,” so it coincides with$(m-1)$-triviality. On a broader scale, we see thatm-distality is a strengthening of Saharon Shelah’s notion ofm-dependence. (shrink)

We address the classification of the possible finitely-additive probability measures on the Boolean algebra of definable subsets of M which are invariant under the natural action of $\operatorname{Aut}(M)$ . This pursuit requires a generalization of Shelah's forking formulas [8] to "essentially measure zero" sets and an application of Myer's "rank diagram" [5] of the Boolean algebra under consideration. The classification is completed for a large class of ℵ 0 -categorical structures without the independence property including those which are (...) class='Hi'>stable. (shrink)

Non-perfect separably closed fields are stable, and not superstable. As a result, not all types can be ranked. We develop here a new tool, a "semi-rank", which takes values in the non-negative reals, and gives a sufficient condition for forking of types. This semi-rank is built up from a transcendence function, analogous to the one considered by Kolchin in the context of differentially closed fields. It yields some orthogonality and stratification results. /// Un corps séparablement clos non algébriquement (...) clos est stable sans être superstable. Cela signifie que seuls certains de ses types sont rangés. Nous développons un autre outil, un "semi-rang" à valeurs réelles, qui donne un critère de déviation des types. Ce semi-rang est construit à partir d'un analogue de la fonction de Kolchin associée à un type au-dessus d'un corps différentiel. Il produit des résultats de stratification des modèles et des résultats d'orthogonalité. (shrink)

We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular, it follows from our investigation that in resilient theories strict non-forking is symmetric. Based on this study, we develop notions of weight which characterize NTP2, dependence and strong dependence. Many of our proofs rely on careful analysis of sequences that witness dividing. We prove simple characterizations of such sequences in resilient theories, as well as of Morley sequences (...) which are witnesses. As a by-product we obtain information on types co-dominated by generically stable types in dependent theories. For example, we prove that every Morley sequence in such a type is a witness. (shrink)

We study a class of 0-categorical simple structures such that every M in has uncomplicated forking behavior and such that definable relations in M which do not cause forking are independent in a sense that is made precise; we call structures in independent. The SU-rank of such M may be n for any natural number n>0. The most well-known unstable member of is the random graph, which has SU-rank one. The main result is that for every strongly independent (...) structure M in , if a sentence φ is true in M then φ is true in a finite substructure of M. The same conclusion holds for every structure in with SU-rank one; so in this case the word ‘strongly’ can be removed. A probability theoretic argument is involved and it requires sufficient independence between relations which do not cause forking. A stable structure M belongs to if and only if it is 0-categorical, 0-stable and every definable strictly minimal subset of is indiscernible. (shrink)

"What can we expect from the study of Chinese philosophy? « In the philosophical systems of the Hindoos and the Chinese there are still hidden treasures, in which the anticipation of scientific discoveries, the results of thousands of years of occidental research, is most striking. Such are the words of Edward von Hartmann, the most famous living German philosopher1. Much labour has been spent in Europe on the Indian Vedanta philosophy, which had such a marked influence on Arthur Schopenhauer. « (...) The Upanishads, says the author of the Parerga and Paralipomena, are the outcome of the highest human wisdom.... They afford the most remunerative and sublime reading possible in this world, which has been the consolation of my life, as it will be that of my death 2. I do not see why the many germs scattered over the vast field of Chinese philosophy should not have a similar fertilizing influence on some philosophical European mind also. The deep impression caused by the Tao-tê-king will support my view. But much work remains to be done before Chinese philosophy will take its proper place in the history of philosophy. The burden of this task lies with us who are living in China and studying her language and literature, for, while great care is bestowed on all her sister languages in Europe and America, Chinese, the oldest of all, but the youngest in the curriculum of our high-schools, is treated as a step-child by public opinion. This paper is meant as a move in the direction just indicated.". (shrink)

Journal of Philosophy of Education, EarlyView.

This, the book shows, has radical implications, particularly for the question of how we seek to educate children. One Aristotelian legacy is the unquestioned belief that societies must educate the young irrespective of the latter's wishes.