On the complexity of the theory of a computably presented metric structure

Caleb Camrud, Isaac Goldbring, Timothy H. McNicholl

We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value o…