Countable models of trivial theories which admit finite coding
Keyword(s):
AbstractWe prove:Theorem. A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding hasnonisomorphic countable models.Combined with the corresponding result or superstable theories from [4] our result confirms the Vaught conjecture for trivial theories which admit finite coding.
1986 ◽
Vol 51
(2)
◽
pp. 412-420
◽
Keyword(s):
Keyword(s):
1974 ◽
Vol 20
(8-12)
◽
pp. 173-178
◽
Keyword(s):
Keyword(s):