Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Stable theories without dense forking chains

Stable theories without dense forking chains We define a generalized notion of rank for stable theories without dense forking chains, and use it to derive that every type is domination-equivalent to a finite product of regular types. We apply this to show that in a small theory admitting finite coding, no realisation of a nonforking extension of some strong type can be algebraic over some realisation of a forking extension. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Loading next page...
 
/lp/springer-journals/stable-theories-without-dense-forking-chains-OLbkkL01ZN

References (8)

Publisher
Springer Journals
Copyright
Copyright © 1992 by Springer-Verlag
Subject
Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/BF01627503
Publisher site
See Article on Publisher Site

Abstract

We define a generalized notion of rank for stable theories without dense forking chains, and use it to derive that every type is domination-equivalent to a finite product of regular types. We apply this to show that in a small theory admitting finite coding, no realisation of a nonforking extension of some strong type can be algebraic over some realisation of a forking extension.

Journal

Archive for Mathematical LogicSpringer Journals

Published: Mar 23, 2005

There are no references for this article.