Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Pillay (1989)
Stable Theories, Pseudoplanes and the Number of Countable ModelsAnn. Pure Appl. Log., 43
E. Hrushovski (1987)
Locally modular regular types
E. Hrushovski (1989)
Finitely based theoriesJournal of Symbolic Logic, 54
D. Lascar, J. Wallington (1990)
Stability in model theory
F. Wagner (1991)
Small stable groups and genericsJournal of Symbolic Logic, 56
A. Pillay (1983)
Introduction to stability theory, 8
B.P. Poizat (1985)
Cours de théorie des modèles
E. Hrushovski (1987)
Classification theory
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.
Archive for Mathematical Logic – Springer Journals
Published: Mar 23, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.