Stable types in rosy theories
| dc.contributor.author | Assaf Hasson | |
| dc.contributor.author | Alf Onshuus | |
| dc.coverage.spatial | Bolivia | |
| dc.date.accessioned | 2026-03-22T14:49:21Z | |
| dc.date.available | 2026-03-22T14:49:21Z | |
| dc.date.issued | 2010 | |
| dc.description | Citaciones: 11 | |
| dc.description.abstract | 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. | |
| dc.identifier.doi | 10.2178/jsl/1286198144 | |
| dc.identifier.uri | https://doi.org/10.2178/jsl/1286198144 | |
| dc.identifier.uri | https://andeanlibrary.org/handle/123456789/48748 | |
| dc.language.iso | en | |
| dc.publisher | Cambridge University Press | |
| dc.relation.ispartof | Journal of Symbolic Logic | |
| dc.source | University of Oxford | |
| dc.subject | Extension (predicate logic) | |
| dc.subject | Rank (graph theory) | |
| dc.subject | Type (biology) | |
| dc.subject | Mathematics | |
| dc.subject | Context (archaeology) | |
| dc.subject | Stability (learning theory) | |
| dc.title | Stable types in rosy theories | |
| dc.type | article |