pith. sign in

arxiv: 1210.5957 · v1 · pith:7FXIGVYUnew · submitted 2012-10-22 · 🧮 math.LO

Generic stability and stability

classification 🧮 math.LO
keywords stabilitystablegenericresultstypesanswerarbitraryassuming
0
0 comments X
read the original 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)\in S(B)$ is stable and does not fork over $A$ then $p\restriction A$ is stable. (They had solved some special cases.)

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.