Motivated by the theory of domination for types, we introduce a notion of domination for Keisler measures called extension domination. We argue that this variant of domination behaves similarly to its typesetting counterpart. We prove that extension domination extends domination for types and that it forms a preorder on the space of global Keisler measures. We then explore some basic properties related to this notion (e.g., approximations by formulas, closure under localizations, convex combinations). We also prove a few preservation theorems (...) and provide some explicit examples. (shrink)

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 stability for types coincides with the notion of a frequency interpretation measure. We also give combinatorial examples of types in NSOP theories that are finitely approximated but not generically stable, as well as ϕ-types in simple theories that are definable and finitely satisfiable in a small (...) model, but not finitely approximated. Our proofs demonstrate interesting connections to classical results from Ramsey theory for finite graphs and hypergraphs. (shrink)

We investigate some dynamical features of the actions of automorphisms in the context of model theory. We interpret a few notions such as compact systems, entropy and symbolic representations from the theory of dynamical systems in the realm of model theory. In this direction, we settle a number of characterizations of NIP theories in terms of dynamics of automorphisms and invariant measures. For example, it is shown that the property of NIP corresponds to the compactness property of some associated systems (...) and also to the zero entropy property of automorphisms. These results give a correspondence between some notions of tameness in model theory and ergodic theory. Moreover, we study the concept of symbolic representation and consider it in some well known mathematical objects such as the circle group, Bohr sets, Sturmian sequences, the structure \\), and random graphs with a model theoretic point of view in mind. We establish certain characterizations for stability theoretic dividing lines, such as independence property, order property and strict order property in terms of associated symbolic representations. At the end, we propose some applications of symbolic representations and these characterizations by giving a proof for a classical theorem by Shelah and also introducing some invariants associated to the types and elements of models. (shrink)

We use exact saturation to study the complexity of unstable theories, showing that a variant of this notion called pseudo-elementary class (PC)-exact saturation meaningfully reflects combinatorial dividing lines. We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals satisfying mild set-theoretic hypotheses. This had previously been open even (...) for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analog of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories. (shrink)

We prove a generalization of the Elekes–Szabó theorem [G. Elekes and E. Szabó, How to find groups?, Combinatorica 32 537–571 ] for relations defina...

We study invariant types in NIP theories. Amongst other things: we prove a definable version of the [Formula: see text]-theorem in theories of small or medium directionality; we construct a canonical retraction from the space of [Formula: see text]-invariant types to that of [Formula: see text]-finitely satisfiable types; we show some amalgamation results for invariant types and list a number of open questions.

We show that a complete first-order theory T is distal provided it has a model M such that the theory of the Shelah expansion of M is distal.

We study the monoid of global invariant types modulo domination-equivalence in the context of o-minimal theories. We reduce its computation to the problem of proving that it is generated by classes...

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)

This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the -theorem holds in dp-minimal theories of small or medium directionality.In the second part, we study dp-rank in dp-minimal theories and show that it enjoys many nice properties. It is continuous, definable in families and it can be characterised geometrically with no mention of indiscernible sequences. In particular, if the structure (...) expands a divisible ordered abelian group, then dp-rank coincides with the dimension coming from the order. (shrink)

The aim of this paper is to develop the theory of groups definable in the p-adic field ${{\mathbb {Q}}_p}$, with “definable f-generics” in the sense of an ambient saturated elementary extension of ${{\mathbb {Q}}_p}$. We call such groups definable f-generic groups.So, by a “definable f-generic” or $dfg$ group we mean a definable group in a saturated model with a global f-generic type which is definable over a small model. In the present context the group is definable over ${{\mathbb {Q}}_p}$, and (...) the small model will be ${{\mathbb {Q}}_p}$ itself. The notion of a $\mathrm {dfg}$ group is dual, or rather opposite to that of an $\operatorname {\mathrm {fsg}}$ group (group with “finitely satisfiable generics”) and is a useful tool to describe the analogue of torsion-free o-minimal groups in the p-adic context.In the current paper our group will be definable over ${{\mathbb {Q}}_p}$ in an ambient saturated elementary extension $\mathbb {K}$ of ${{\mathbb {Q}}_p}$, so as to make sense of the notions of f-generic type, etc. In this paper we will show that every definable f-generic group definable in ${{\mathbb {Q}}_p}$ is virtually isomorphic to a finite index subgroup of a trigonalizable algebraic group over ${{\mathbb {Q}}_p}$. This is analogous to the o-minimal context, where every connected torsion-free group definable in $\mathbb {R}$ is isomorphic to a trigonalizable algebraic group [5, Lemma 3.4]. We will also show that every open definable f-generic subgroup of a definable f-generic group has finite index, and every f-generic type of a definable f-generic group is almost periodic, which gives a positive answer to the problem raised in [28] of whether f-generic types coincide with almost periodic types in the p-adic case. (shrink)

The aim of this work is an analysis of distal and non‐distal behavior in dense pairs of o‐minimal structures. A characterization of distal types is given through orthogonality to a generic type in, non‐distality is geometrically analyzed through Keisler measures, and a distal expansion for the case of pairs of ordered vector spaces is computed.

We solve two problems from a work of Haskel and Pillay concerning maximal stable quotients of groups ∧-definable in NIP theories. The first result says that if G is a ∧-definable group in a distal theory, then Gst=G00 (where Gst is the smallest ∧-definable subgroup with G∕Gst stable, and G00 is the smallest ∧-definable subgroup of bounded index). In order to get it, we prove that distality is preserved under passing from T to the hyperimaginary expansion Theq. The second result (...) is an example of a group G definable in a nondistal NIP theory for which G=G00, but Gst is not an intersection of definable groups. Our example is a saturated extension of (R,+,[0,1]). Moreover, we make some observations on the question whether there is such an example which is a group of finite exponent. We also take the opportunity and give several characterizations of stability of hyperdefinable sets involving continuous logic. (shrink)

A theory [Formula: see text] is said to have exact saturation at a singular cardinal [Formula: see text] if it has a [Formula: see text]-saturated model which is not [Formula: see text]-saturated. We show, under some set-theoretic assumptions, that any simple theory has exact saturation. Also, an NIP theory has exact saturation if and only if it is not distal. This gives a new characterization of distality.

We consider interpretable topological spaces and topological groups in a p-adically closed field K. We identify a special class of “admissible topologies” with topological tameness properties like generic continuity, similar to the topology on definable subsets of Kn. We show that every interpretable set has at least one admissible topology, and that every interpretable group has a unique admissible group topology. We then consider definable compactness (in the sense of Fornasiero) on interpretable groups. We show that an interpretable group is (...) definably compact if and only if it has finitely satisfiable generics (fsg), generalizing an earlier result on definable groups. As a consequence, we see that fsg is a definable property in definable families of interpretable groups, and that any fsg interpretable group defined over Qp is definably isomorphic to a definable group. (shrink)

The aim of this note is to determine whether certain non-o-minimal expansions of o-minimal theories which are known to be NIP, are also distal. We observe that while tame pairs of o-minimal structures and the real field with a discrete multiplicative subgroup have distal theories, dense pairs of o-minimal structures and related examples do not.

The derivation on the differential-valued field Tlogof logarithmic transseries induces on its value group${{\rm{\Gamma }}_{{\rm{log}}}}$a certain mapψ. The structure${\rm{\Gamma }} = \left$is a divisible asymptotic couple. In [7] we began a study of the first-order theory of$\left$where, among other things, we proved that the theory$T_{{\rm{log}}} = Th\left$has a universal axiomatization, is model complete and admits elimination of quantifiers in a natural first-order language. In that paper we posed the question whetherTloghas NIP. In this paper, we answer that question in the (...) affirmative:Tlogdoes have NIP. Our method of proof relies on a complete survey of the 1-types ofTlog, which, in the presence of QE, is equivalent to a characterization of all simple extensions${\rm{\Gamma }}\left\langle \alpha \right\rangle$of${\rm{\Gamma }}$. We also show thatTlogdoes not have the Steinitz exchange property and we weigh in on the relationship between models ofTlogand the so-calledprecontraction groupsof [9]. (shrink)

We show that the theory Tlog of the asymptotic couple of the field of logarithmic transseries is distal. As distal theories are NIP, this provides a new proof that Tlog is NIP.

Let T be a complete, model complete o-minimal theory extending the theory RCF of real closed ordered fields in some appropriate language L. We study derivations δ on models ℳ⊧T. We introduce the no...

We introduce and study (weakly) semi-equational theories, generalizing equationality in stable theories (in the sense of Srour) to the NIP context. In particular, we establish a connection to distality via one-sided strong honest definitions; demonstrate that certain trees are semi-equational, while algebraically closed valued fields are not weakly semi-equational; and obtain a general criterion for weak semi-equationality of an expansion of a distal structure by a new predicate.