Publisher： Cambridge University Press
E-ISSN： 1943-5886|75|4|1211-1230
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.75, Iss.4, 2010-12, pp. : 1211-1230
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Related content
On generically stable types in dependent theories
The Journal of Symbolic Logic, Vol. 74, Iss. 1, 2009-03 ,pp. :
Access to resources
Recommend
Omitting types for stable ccc theories
The Journal of Symbolic Logic, Vol. 55, Iss. 3, 1990-09 ,pp. :
The Journal of Symbolic Logic, Vol. 72, Iss. 3, 2007-09 ,pp. :
Regular types in nonmultidimensional ω-stable theories
The Journal of Symbolic Logic, Vol. 49, Iss. 3, 1984-09 ,pp. :
Weight
The Journal of Symbolic Logic, Vol. 60, Iss. 2, 1995-06 ,pp. :