The complexity of the classification problem of continua

Cheng Chang; Su Gao

REVIEW

The complexity of the classification problem of continua

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1510.08969 v2 pith:WUGWNF4O submitted 2015-10-30 math.LO math.GN

The complexity of the classification problem of continua

Cheng Chang , Su Gao This is my paper

classification math.LO math.GN

keywords borelproblemactionbireducibleclassificationcompactcomplexityconnected

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We prove that the homeomorphism problem for connected compact metric spaces is Borel bireducible with a universal orbit equivalence relation induced by a Borel action of a Polish group.

The complexity of the classification problem of continua

discussion (0)