Key points are not available for this paper at this time.
We investigate the descriptive complexity of the set of models of first-order theories. Using classical results of Knight and Solovay, we give a sharp condition for complete theories to have a _⁰-complete set of models. We also give sharp conditions for theories to have a ⁰ₙ-complete set of models. Finally, we determine the Turing degrees needed to witness the completeness.
Andrews et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: