The relation of recursive isomorphism for countable structures

Journal of Symbolic Logic 67 (2):879-895 (2002)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,169

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Isomorphism of Locally Compact Polish Metric Structures.Maciej Malicki - 2024 - Journal of Symbolic Logic 89 (2):646-664.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
Analytic equivalence relations and bi-embeddability.Sy-David Friedman & Luca Motto Ros - 2011 - Journal of Symbolic Logic 76 (1):243 - 266.
The Borel Complexity of Isomorphism for Theories with Many Types.David Marker - 2007 - Notre Dame Journal of Formal Logic 48 (1):93-97.
Popa superrigidity and countable Borel equivalence relations.Simon Thomas - 2009 - Annals of Pure and Applied Logic 158 (3):175-189.
Countable borel equivalence relations.S. Jackson, A. S. Kechris & A. Louveau - 2002 - Journal of Mathematical Logic 2 (01):1-80.

Analytics

Added to PP
2009-01-28

Downloads
56 (#424,513)

6 months
16 (#194,991)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references