Countable models of trivial theories which admit finite coding

Abstract

We prove: THEOREM. A complete first order theory in a countable language which is strictly stable, trivial and which admits finite coding has 2 N0 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.