Stable theories, pseudoplanes and the number of countable models (Q1122570)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stable theories, pseudoplanes and the number of countable models |
scientific article |
Statements
Stable theories, pseudoplanes and the number of countable models (English)
0 references
1989
0 references
The main result is: Given a stable theory with at least two but with no more than a finite number of countable models, the theory has a type- definable pseudoplane. Further, any stable theory either has a type- definable pseudoplane or is 1-based. Since this paper was written (five years ago), it has been shown by Belegradek and by Hodges that some theories are both 1-based and have type-definable pseudoplanes - the ``or'' above, therefore, is not exclusive.
0 references
1-based theory
0 references
stable theory
0 references
countable models
0 references
type-definable pseudoplane
0 references
0 references
