# Externally definable sets and dependent pairs II

@article{Chernikov2012ExternallyDS,
title={Externally definable sets and dependent pairs II},
author={Artem Chernikov and Pierre Simon},
journal={Transactions of the American Mathematical Society},
year={2012},
volume={367},
pages={5217-5235}
}
• Published 13 February 2012
• Mathematics
• Transactions of the American Mathematical Society
Author(s): Chernikov, A; Simon, P | Abstract: We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of non-forking instances of a formula (with parameters ranging over a type-definable set) can be covered with finitely many invariant types; we give some criteria for the boundedness of an expansion by a new predicate in…
• Mathematics
• 2012
Author(s): Chernikov, A; Simon, P | Abstract: We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most
• Mathematics
J. Lond. Math. Soc.
• 2014
We prove that many properties and invariants of definable groups in NIP theories (i.e. theories without the independence property), such as definable amenability, G/G00 , etc., are preserved when
It is proved that an invariant dp-minimal type is either finitely satisfiable or definable, and it is shown that if the structure expands a divisible ordered abelian group, then d p-rank coincides with the dimension coming from the order.
• Mathematics
• 2022
Given a structure M and a stably embedded ∅-definable set Q, we prove tameness preservation results when enriching the induced structure on Q by some further structure Q. In particular, we show that
• Computer Science, Mathematics
• 2022
It is shown that all reasonable notions of deﬁnable compactness agree on interpretable topological spaces, and that deﷁnables compactness is deﵡnable in families.
For an infinite cardinal κ, let dedκ denote the supremum of the number of Dedekind cuts in linear orders of size κ. It is known that κ < ded κ ≤ 2κ for all κ and that dedκ < 2κ is consistent for any
• Mathematics
Math. Log. Q.
• 2016
This article characterize pairs of algebraically closed valued fields satisfying the same property as Marker and Steinhorn's models of an o-minimal theory such that all types over M realized in N are definable.
A definable version of the (p,q)-theorem in theories of small or medium directionality is proved and some amalgamation results for invariant types are shown.
Let S be a family of sets with VC-codensity less than 2. We prove that, if S has the ( ω, 2)-property (for any inﬁnitely many sets in S , at least 2 among them intersect), then S can be partitioned
• Mathematics
• 2022
. We study coﬁnal systems of ﬁnite subsets of ω 1 . We show that while such systems can be NIP, they cannot be deﬁned in an NIP structure. We deduce a positive answer to a question of Chernikov and

## References

SHOWING 1-10 OF 48 REFERENCES

• Mathematics
• 2012
Author(s): Chernikov, A; Simon, P | Abstract: We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most
This paper explores UDTFS and shows how it relates to well-known properties in model theory and recalls that stable theories and weakly o-minimal theories have UDTFF and implies dependence.
• Mathematics
• 2007
We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of NIP (not the independence property), continuing aspects of the paper [13]. Among key results are
A dependent theory is a (first order complete theory) T which does not have the independence property. A major result here is: if we expand a model of T by the traces on it of sets definable in a
• A. Pillay
• Mathematics
The Journal of Symbolic Logic
• 2011
This paper gives some sufficient conditions for a predicate P in a complete theory T to be “stably embedded” and makes use of the theory of strict nonforking and weight in NIP theories.
We further investigate the class of models of a strongly dependent (first order complete) theory T, continuing [Sh:715], [Sh:783] and related works. Those are properties (= classes) somewhat parallel
The structure of definable sets and maps in dense elementary pairs of o-minimal expansions of ordered abelian groups is described. It turns out that a certain notion of “small definable set” plays a
• Mathematics
Journal of Symbolic Logic
• 2001
Every algebraic set intersects U in a finite union of translates of subgroups definable in the group structure of U alone and whence Uind is nothing more than a (divisible) abelian group, which isω–stable.
• Mathematics
Journal of Symbolic Logic
• 1994
The goal is to provide a characterization of definable types over r-minimal structures that generalizes van den Dries' results and shows that every type over an M- minimal expansion -of R is definable.
• Mathematics
Discret. Comput. Geom.
• 2010
The combinatorial complexity of any definable family in a structure with a o-minimal theory is bounded by the number of parameters in the defining formula, and extended compression schemes for uniformly definable families corresponding to stable formulas are shown to exist.