Abstract
Let L be a finite relational language and H(L) denote the class of all countable stable L-structures M for which Th(M) admits elimination of quantifiers. For M ∈H(L) define the rank of M to be the maximum value of CR(p, 2), where p is a complete 1-type over Ø and CR(p, 2) is Shelah's complete rank. If L has only unary and binary relation symbols there is a uniform finite bound for the rank of M ∈H(L). This theorem confirms part of a conjecture of the first author. Intuitively it says that for each L there is a finite bound on the complexity of the structures in H(L).
Original language | English |
---|---|
Pages (from-to) | 155-180 |
Number of pages | 26 |
Journal | Israel Journal of Mathematics |
Volume | 49 |
Issue number | 1-3 |
DOIs | |
State | Published - Sep 1984 |