Countable models of trivial theories which admit finite coding
James G. Loveys, Predrag Tanović · Journal of Symbolic Logic · 1996
Abstract We prove: Theorem. A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding has nonisomorphic 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.