paper

A computability theoretic equivalent to Vaught's conjecture

arXiv:1206.5682

Abstract

We prove that, for every theory which is given by an sentence, has less than many countable models if and only if we have that, for every on a cone of Turing degrees, every -hyperarithmetic model of has an -computable copy. We also find a concrete description, relative to some oracle, of the Turing-degree spectra of all the models of a counterexample to Vaught's conjecture.