The complexity of classification problems for models of arithmetic
Coskey, Samuel ; Kossak, Roman
Bull. Symbolic Logic, Tome 16 (2010) no. 1, p. 345-358 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2010-09-15
Classification:  
@article{1286284557,
     author = {Coskey, Samuel and Kossak, Roman},
     title = {The complexity of classification problems for models of arithmetic},
     journal = {Bull. Symbolic Logic},
     volume = {16},
     number = {1},
     year = {2010},
     pages = { 345-358},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1286284557}
}

Coskey, Samuel; Kossak, Roman. The complexity of classification problems for models of arithmetic. Bull. Symbolic Logic, Tome 16 (2010) no. 1, pp.  345-358. http://gdmltest.u-ga.fr/item/1286284557/