算术模型分类问题的复杂性
The complexity of classification problems for models of arithmetic
摘要：
我们观察到可数算术模型的分类问题是Borel完全的。另一方面，分类问题的递归生成的模型的算术和递归的饱和模型的算术是博雷尔，我们调查的精确的复杂性，每个这些。最后，我们证明了递归饱和模型对和固定递归饱和模型的自同构的分类问题是Borel完全的。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
