The complexity of classification problems for models of arithmetic

@article{Coskey2010TheCO,
  title={The complexity of classification problems for models of arithmetic},
  author={Samuel Coskey and Roman Kossak},
  journal={Bull. Symb. Log.},
  year={2010},
  volume={16},
  pages={345-358}
}
  • Samuel Coskey, Roman Kossak
  • Published 2010
  • Mathematics, Computer Science
  • Bull. Symb. Log.
  • 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. 

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES