Article contents
Stable types in rosy theories
Published online by Cambridge University Press: 12 March 2014
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2010
References
REFERENCES
- 4
- Cited by