Article contents
Stable structures with few substructures
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1996
References
REFERENCES
- 3
- Cited by