Finitely based theories
- 12 March 1989
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 54 (1) , 221-225
- https://doi.org/10.2307/2275026
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- A survey of basic stability theory, with particular emphasis on orthogonality and regular typesIsrael Journal of Mathematics, 1984
- The spectrum problem I: ℵɛ-satuarted models, the main gapIsrael Journal of Mathematics, 1982
- Two conjectures regarding the stability of ω-categorical theoriesFundamenta Mathematicae, 1973
- A property of stable theoriesFundamenta Mathematicae, 1972