Article contents
GENERIC STABILITY AND STABILITY
Published online by Cambridge University Press: 17 April 2014
Abstract
We prove two results about generically stable types p in arbitrary theories. The first, on existence of strong germs, generalizes results from [2] 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 prestrictionA is stable. (They had solved some special cases.)
- Type
- Articles
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2014
References
REFERENCES
- 3
- Cited by