We study the behaviour of stable types in rosy theories. The main technical result is that a non-þ-forking extension of an unstable type is unstable. We apply this to show that a rosy group with a þ-generic stable type is stable. In the context of super-rosy theories of finite rank we conclude that non-trivial stable types of Uþ-rank 1 must arise from definable stable sets.
"Stable types in rosy theories." J. Symbolic Logic 75 (4) 1211 - 1230, December 2010. https://doi.org/10.2178/jsl/1286198144