The Complexity of Homeomorphism Relations on Some Classes of Compacta

Journal of Symbolic Logic 85 (2):733-748 (2020)
  Copy   BIBTEX

Abstract

We prove that the homeomorphism relation between compact spaces can be continuously reduced to the homeomorphism equivalence relation between absolute retracts, which strengthens and simplifies recent results of Chang and Gao, and Cieśla. It follows then that the homeomorphism relation of absolute retracts is Borel bireducible with the universal orbit equivalence relation. We also prove that the homeomorphism relation between regular continua is classifiable by countable structures and hence it is Borel bireducible with the universal orbit equivalence relation of the permutation group on a countable set. On the other hand we prove that the homeomorphism relation between rim-finite metrizable compacta is not classifiable by countable structures.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

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

Logics which capture complexity classes over the reals.Felipe Cucker & Klaus Meer - 1999 - Journal of Symbolic Logic 64 (1):363-390.
Some Ramsey theory in Boolean algebra for complexity classes.Gregory L. McColm - 1992 - Mathematical Logic Quarterly 38 (1):293-298.
On Σ1 1 equivalence relations with Borel classes of bounded rank.Ramez L. Sami - 1984 - Journal of Symbolic Logic 49 (4):1273 - 1283.
On one-sided versus two-sided classification.Stephan Frank - 2001 - Archive for Mathematical Logic 40 (7):489-513.
Homeomorphism and the Equivalence of Logical Systems.Stephen Pollard - 1998 - Notre Dame Journal of Formal Logic 39 (3):422-435.
Isomorphism Testing For Equivalence Relations.Edward Szczypka - 1996 - Reports on Mathematical Logic:101-109.
Generic separations and leaf languages.M. Galota, H. Vollmer & S. Kosub - 2003 - Mathematical Logic Quarterly 49 (4):353.
Context-sensitive transitive closure operators.Iain A. Stewart - 1994 - Annals of Pure and Applied Logic 66 (3):277-301.

Analytics

Added to PP
2020-06-18

Downloads
16 (#932,051)

6 months
4 (#859,620)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Add more references