Abstract
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
Citation
Riccardo Camerlo. "The relation of recursive isomorphism for countable structures." J. Symbolic Logic 67 (2) 879 - 895, June 2002. https://doi.org/10.2178/jsl/1190150114
Information
