Generic stability and stability

From MaRDI portal



Abstract: We prove two results about generically stable types p 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) for all m. We use the latter result to answer in full generality a question posed by Hasson and Onshuus: If p(x)inS(B) is stable and does not fork over A then pestrictionA is stable. (They had solved some special cases.)











This page was built for publication: Generic stability and stability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921027)