English

Generic stability and stability

Logic 2012-10-23 v1

Abstract

We prove two results about generically stable types pp in arbitrary theories. The first, on existence of strong germs, generalizes results from D. Haskell, E. Hrushovski and D. Macpherson on stably dominated types. The second is an equivalence of forking and dividing, assuming generic stability of p(m)p^{(m)} for all mm. We use the latter result to answer in full generality a question posed by Hasson and Onshuus: If p(x)S(B)p(x)\in S(B) is stable and does not fork over AA then pAp\restriction A is stable. (They had solved some special cases.)

Keywords

Cite

@article{arxiv.1210.5957,
  title  = {Generic stability and stability},
  author = {Hans Adler and Enrique Casanovas and Anand Pillay},
  journal= {arXiv preprint arXiv:1210.5957},
  year   = {2012}
}
R2 v1 2026-06-21T22:25:54.457Z