The relation of recursive isomorphism for countable structures
Camerlo, Riccardo
J. Symbolic Logic, Tome 67 (2002) no. 1, p. 879-895 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
It is shown that the relations of recursive isomorphism on countable trees, groups, Boolean algebras, fields and total orderings are universal countable Borel equivalence relations, thus providing a countable analogue of the Borel completeness of the isomorphism relations on these same classes. I
Publié le : 2002-06-14
Classification:  03E15,  03D20 
@article{1190150114,
     author = {Camerlo, Riccardo},
     title = {The relation of recursive isomorphism for countable structures},
     journal = {J. Symbolic Logic},
     volume = {67},
     number = {1},
     year = {2002},
     pages = { 879-895},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1190150114}
}

Camerlo, Riccardo. The relation of recursive isomorphism for countable structures. J. Symbolic Logic, Tome 67 (2002) no. 1, pp.  879-895. http://gdmltest.u-ga.fr/item/1190150114/