Generic stability and stability
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)∈ S(B) is stable and does not fork over A then p A is stable. (They had solved some special cases.)
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.