Related papers: Non-forking independence in stable theories
We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent (NIP) theories.
We study NSOP$_{1}$ theories. We define Kim-independence, which generalizes non-forking independence in simple theories and corresponds to non-forking at a generic scale. We show that Kim-independence satisfies a version of Kim's lemma,…
Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…
In the first part of this work the notion of stable Kim-forking is discussed and some context on this matter is given. In the second part a general way of building some examples of NSOP1 theories as the limit of some Fraisse class…
We provide a differential-algebraic description of forking independence in the stable theory DCF$_{p,m}$ of differentially closed fields of characteristic $p>0$ with $m$-many commuting derivations. As a by-product of this description, we…
We study Kim-independence over arbitrary sets. Assuming that forking satisfies existence, we establish Kim's lemma for Kim-dividing over arbitrary sets in an NSOP$_{1}$ theory. We deduce symmetry of Kim-independence and the independence…
We characterize nonforking (Morley) sequences in dependent theories in terms of a generalization of Poizat's special sequences and show that average types of Morley sequences are stationary over their domains. We characterize generically…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that…
An important dividing line in the class of unstable theories is being NSOP$_1$, which is more general than being simple. In NSOP$_1$ theories forking independence may not be as well-behaved as in stable or simple theories, so it is replaced…
We presents an independence relation on sets, one can define dimension by it, assuming that we have an abstract elementary class with a forking notion that satisfies the axioms of a good frame minus stability.
Kim's Lemma is a key ingredient in the theory of forking independence in simple theories. It asserts that if a formula divides, then it divides along every Morley sequence in type of the parameters. Variants of Kim's Lemma have formed the…
This course introduces the fruitful links between model theory and a combinatoric of sets given by independence relations. An independence relation on a set is a ternary relation between subsets. Chapter 1 should be considered as an…
We develop a new notion of independence suggested by Scanlon (th-independence). We prove that in a large class of theories (which includes all simple theories) this notion has many of the properties needed for an adequate geometric…
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…
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…
A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…
We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain…
We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories…