Assaf HassonAlf Onshuus2026-03-222026-03-22201010.2178/jsl/1286198144https://doi.org/10.2178/jsl/1286198144https://andeanlibrary.org/handle/123456789/48748Citaciones: 11Abstract 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.enExtension (predicate logic)Rank (graph theory)Type (biology)MathematicsContext (archaeology)Stability (learning theory)article