Abstract

Millar showed that for each n<ω, there is a complete decidable theory having precisely eighteen nonisomorphic countable models where some of these are decidable exactly in the hyperarithmetic set H. By combining ideas from Millar's proof with a technique of Peretyat'kin, the author reduces the number of countable models to five. By a theorem of Millar, this is the smallest number of countable models a decidable theory can have if some of the models are not 0″-decidable