Abstract.
We obtain a chain condition for dividing in an arbitrary theory and a new and shorter proof of a chain condition result of Shelah for simple theories.
Similar content being viewed by others
References
Casanovas, E.: The number of types in simple theories. Ann. Pure Appl. Logic 98, 69–86 (1999)
Casanovas, E., Lascar, D., Pillay, A., Ziegler, M.: Galois groups of first order theories. J. Math. Logic 1, 305–319 (2001)
Grossberg, R., Iovino, J., Lessmann, O.: A primer of simple theories. Arch. Math. Logic 41, 541–580 (2002)
Hrushovski, E.: Simplicity and the Lascar group. Preprint, 1997
Kim, B.: Simple first order theories, Ph.D. Thesis, University of Notre Dame, 1996
Kim, B.: Forking in simple unstable theories. J. London Math. Soc. 57, 257–267 (1998)
Kim, B., Pillay, A.: Simple theories. Ann. Pure Appl. Logic 88, 149–164 (1997)
Lessmann, O.: Counting partial types in simple theories. Colloquium Mathematicum 83, 201–208 (2000)
Shami, Z.: Definability in low simple theories. The Journal of Symbolic Logic 65, 1481–1490 (2000)
Shelah, S.: Simple unstable theories. Ann. Math. Logic 19, 177–203 (1980)
Author information
Authors and Affiliations
Corresponding author
Additional information
Work partially supported by grant PB98-1231 of the Spanish Government. The author wishes to thank Anand Pillay for helpful comments on a first version of this article.
Mathematics Subject Classification (2000): 03C45
Rights and permissions
About this article
Cite this article
Casanovas, E. Dividing and chain conditions. Arch. Math. Logic 42, 815–819 (2003). https://doi.org/10.1007/s00153-003-0192-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-003-0192-0