The complexity of the classification problems of finite-dimensional continua

DOI10.1016/j.topol.2019.106876zbMath1468.03056arXiv1904.09634OpenAlexW2971768047MaRDI QIDQ2329346

Su Gao, Cheng Chang

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

continuumpath-componentgraph isomorphismBorel reducible

Mathematics Subject Classification ID

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

Related Items

CLASSIFICATION OF ONE DIMENSIONAL DYNAMICAL SYSTEMS BY COUNTABLE STRUCTURES, The complexity of homeomorphism relations on some classes of compacta with bounded topological dimension

Cites Work

• The complexity of the homeomorphism relation between compact metric spaces
• The complexity of the classification problem of continua
• A Borel reductibility theory for classes of countable structures
• The completeness of the isomorphism relation for countable Boolean algebras
• Classification problems in continuum theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item