{"paper":{"title":"The Complexity of the Classification Problems of Finite-Dimensional Continua","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GN"],"primary_cat":"math.LO","authors_text":"Cheng Chang, Su Gao","submitted_at":"2019-04-21T17:40:05Z","abstract_excerpt":"We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $n \\geq 2$, 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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09634","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}