Countable models of trivial theories which admit finite coding (Q3128473)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Countable models of trivial theories which admit finite coding |
scientific article |
Statements
Countable models of trivial theories which admit finite coding (English)
0 references
20 August 1997
0 references
trivial theory
0 references
finite coding
0 references
stable theory
0 references
countable models
0 references
Vaught's conjecture
0 references
symmetry lemma
0 references
superstable type
0 references
