Related papers: Theories without the tree property of the second k…

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…

NTP2 is a large class of first-order theories defined by Shelah and generalizing simple and NIP theories. Algebraic examples of NTP2 structures are given by ultra-products of p-adics and certain valued difference fields (such as a…

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…

Tree properties are introduced by Shelah, and it is well-known that a theory has TP (the tree property) if and only if it has TP$_1$ or TP$_2$. In any simple theory (i.e., a theory not having TP), forking supplies a good independence notion…

We prove that in NTP_2 theories if p is a dependent type with dp-rank >= \kappa, then this can be witnessed by indiscernible sequences of tuples satisfying p. If p has dp-rank infinity, then this can be witnessed by singletons (in any…

In this note, we investigate a new model theoretical tree property, called the antichain tree property (ATP). We develop combinatorial techniques for ATP. First, we show that ATP is always witnessed by a formula in a single free variable,…

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…

We prove that the NTP$_1$ property of a geometric theory $T$ is inherited by theories of lovely pairs and $H$-structures associated to $T$. We also provide a class of examples of nonsimple geometric NTP$_1$ theories.

We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…

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…

The main result of this paper is a positive answer to the Conjecture 5.1 by A. Chernikov, I. Kaplan and P. Simon: If M is a PRC field, then Th(M) is NTP_2 if and only if M is bounded. In the case of PpC fields, we prove that if M is a…

If $T$ has dependent dividing, then the burden agrees with the dp-rank witnessed by NIP formulas. We use this observation to prove that if $T$ has dependent dividing, then the burden is sub-additive. We also state a connection between the…

Motivated by the Ax-Kochen/Ershov principle, a large number of questions about henselian valued fields have been shown to reduce to analogous questions about the value group and residue field. In this paper, we investigate the burden of…

We show that the theory of the non-standard Frobenius automorphism, acting on an algebraically closed valued field of equal characteristic 0, is NTP2. More generally, in the contractive as well as in the isometric case, we prove that a…

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…

A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

We investigate the class of FHP theories, i.e. theories of structures in which all definable families of sets satisfy the Fractional Helly Property (and its variants) from combinatorics. FHP theories generalize NIP and form a new subclass…

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

We use axioms of abstract ternary relations to define the notion of a free amalgamation theory. These form a subclass of first-order theories, without the strict order property, encompassing many prominent examples of countable structures…