Related papers: A note on some example of NSOP1 theories
We show that approximations of strict order can calibrate the fine structure of genericity. Particularly, we find exponential behavior within the $\mathrm{NSOP}_{n}$ hierarchy from model theory. Let $0$-$\eth$-independence denote…
We observe that a simple condition suffices to describes non-forking independence over models in a stable theory. Under mild assumptions, this description can be extended to non-forking independence over algebraically closed subsets,…
This paper continues math.LO/0009087. We present a rank function for NSOP_1 theories and give an example of a theory which is NSOP_1 but not simple. We also investigate the connection between maximality in the ordering <^* among complete…
We introduce some properties describing dependence in indiscernible sequences: $F_{ind}$ and its dual $F_{Mb}$, the definable Morley property, and $n$-resolvability. Applying these properties, we establish the following results: We show…
We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…
In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic…
We give three counterexamples to the folklore claim that in an arbitrary theory, if a complete type $p$ over a set $B$ does not divide over $C\subseteq B$, then no extension of $p$ to a complete type over $\text{acl}(B)$ divides over $C$.…
We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…
We develop some model theory of multi-linear forms, generalizing Granger in the bi-linear case. In particular, after proving a quantifier elimination result, we show that for an NIP field K, the theory of infinite dimensional non-degenerate…
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…
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 develop a framework, in the style of Adler, for interpreting the notion of "witnessing" that has appeared (usually as a variant of Kim's Lemma) in different areas of neostability theory as a binary relation between abstract independence…
In this paper we extend the classical Korovkin theorems to the framework of comonotone additive, sublinear and monotone operators. Based on the theory of Choquet capacities, several concrete examples illustrating our results are also…
Like all other knot polynomials, the superpolynomials should be defined in arbitrary representation R of the gauge group in (refined) Chern-Simons theory. However, not a single example is yet known of a superpolynomial beyond symmetric or…
We study Keisler measures in strongly n-distal NIP theories, generalizing some results of Simon and Chernikov-Starchenko for distal theories and addressing some questions of Walker. In particular, we establish a hypergraph version of the…
We give an example of an NIP theory $T$ in which there is a formula that does not fork over $\varnothing$ but has measure $0$ under any global $\varnothing$-invariant Keisler measure, and we show that this cannot occur if $T$ is also…
We study the generic theory of algebraically closed fields of fixed positive characteristic with a predicate for an additive subgroup, called $\mathrm{ACFG}$. This theory was introduced recently as a new example of $\mathrm{NSOP}_1$ non…
We investigate bounds in Ramsey's theorem for relations definable in NIP structures. Applying model-theoretic methods to finitary combinatorics, we generalize a theorem of Bukh and Matousek [B. Bukh, J. Matou\v{s}ek.…
We extend a dichotomy between 1-basedness and supersimplicity proved in a previous paper. The generalization we get is to arbitrary language, with no restrictions on the topology (we do not demand type-definabilty of the open set in the…
It is well-known that assumptions of monotonicity in size-bias couplings may be used to prove simple, yet powerful, Poisson approximation results. Here we show how these assumptions may be relaxed, establishing explicit Poisson…