The complexity of the classification problems of finite-dimensional continua

DOI10.1016/J.TOPOL.2019.106876MaRDI QIDQ2329346zbMATH OpenOpenAlexFDO

Authors Cheng Chang, Su Gao

Publication date 17 October 2019

Published in Topology and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.09634

zbMATH Keywords

Borel reduciblecontinuumgraph isomorphismpath-component

Mathematics Subject Classification ID

Descriptive set theory (03E15) Subspaces in general topology (54B05) Continua and generalizations (54F15) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)

Abstract: We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $ngeq2$, the classification problem of $n$-dimensional continua is strictly more complex than the isomorphism problem of countable graphs. We also obtain results that compare the relative complexity of various equivalence relations.

Recommendations

• The complexity of the classification problem of continua
• Classification problems in continuum theory
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• The classification problem for compact computable metric spaces
• scientific article; zbMATH DE number 6741918
• On the complexity and dimension of continuous finite-dimensional maps
• scientific article; zbMATH DE number 4042850
• Complexity of \(\Sigma^0_n\)-classifications for definable subsets
• Dimension characterizations of complexity classes
• Dimension Characterizations of Complexity Classes

Cites work

• A Borel reductibility theory for classes of countable structures
• Classification problems in continuum theory
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 976831 (Why is no real title available?)
• scientific article; zbMATH DE number 1388189 (Why is no real title available?)
• scientific article; zbMATH DE number 3326329 (Why is no real title available?)
• Invariant descriptive set theory
• The completeness of the isomorphism relation for countable Boolean algebras
• The complexity of the classification problem of continua
• The complexity of the homeomorphism relation between compact metric spaces

Cited in

(11)

• On finitely equivalent continua
• The homeomorphism problem for countable topological spaces
• Classifying Erdős type spaces of higher descriptive complexity
• Classification of Finite-Dimensional Universal Pseudo-Boundaries and Pseudo-Interiors
• Completeness of the homeomorphism relation of locally connected continua
• The complexity of homeomorphism relations on some classes of compacta
• scientific article; zbMATH DE number 6741918 (Why is no real title available?)
• Classification problems in continuum theory
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
• CLASSIFICATION OF ONE DIMENSIONAL DYNAMICAL SYSTEMS BY COUNTABLE STRUCTURES
• The complexity of homeomorphism relations on some classes of compacta with bounded topological dimension

This page was built for publication: The complexity of the classification problems of finite-dimensional continua

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329346)