Stable structures with few substructures
Michael Chris Laskowski, Laura L. Mayer · Journal of Symbolic Logic · 1996
Abstract A countable, atomically stable structure in a finite, relational language has fewer than 2ω non-isomorphic substructures if and only if is cellular. An example shows that the finiteness of the language is necessary.