
arXiv: 1210.5957
AbstractWe prove two results about generically stable typespin arbitrary theories. The first, on existence of strong germs, generalizes results from [2] on stably dominated types. The second is an equivalence of forking and dividing, assuming generic stability ofp(m)for allm. We use the latter result to answer in full generality a question posed by Hasson and Onshuus: IfP(x) εS(B) is stable and does not fork overAthenprestrictionAis stable. (They had solved some special cases.)
strong germs, generically stable types, FOS: Mathematics, Mathematics - Logic, Classification theory, stability, and related concepts in model theory, stable types, Logic (math.LO)
strong germs, generically stable types, FOS: Mathematics, Mathematics - Logic, Classification theory, stability, and related concepts in model theory, stable types, Logic (math.LO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
