The complexity of classification problems for models of arithmetic

This post is a link to https://arxiv.org/abs/0908.1718

With Roman Kossak. Bulletin of symbolic logic 16(3):345–358.

Abstract: We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.