Abstract

We show that the index set complexity of the computably categorical structures is View the MathML source-complete, demonstrating that computable categoricity has no simple syntactic characterization. As a consequence of our proof, we exhibit, for every computable ordinal α , a computable structure that is computably categorical but not relatively View the MathML source-categorical.