Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 54, Issue 1 (1989), 221-225.
Finitely Based Theories
A stable theory is finitely based if every set of indiscernibles is based on a finite subset. This is a common generalization of superstability and 1-basedness. We show that if such theories have more than one model they must have infinitely many, and prove some other conjectures.
J. Symbolic Logic, Volume 54, Issue 1 (1989), 221-225.
First available in Project Euclid: 6 July 2007
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Hrushovski, Ehud. Finitely Based Theories. J. Symbolic Logic 54 (1989), no. 1, 221--225. https://projecteuclid.org/euclid.jsl/1183742862