Bulletin of Symbolic Logic
- Bull. Symbolic Logic
- Volume 16, Issue 3 (2010), 345-358.
The complexity of classification problems for models of arithmetic
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.
Bull. Symbolic Logic, Volume 16, Issue 3 (2010), 345-358.
First available in Project Euclid: 5 October 2010
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Coskey, Samuel; Kossak, Roman. The complexity of classification problems for models of arithmetic. Bull. Symbolic Logic 16 (2010), no. 3, 345--358. doi:10.2178/bsl/1286284557. https://projecteuclid.org/euclid.bsl/1286284557