The Relative Complexity of Various Classification Problems among Compact Metric Spaces
Description:
In this thesis, we discuss three main projects which are related to Polish groups and their actions on standard Borel spaces. In the first part, we show that the complexity of the classification problem of continua is Borel bireducible to a universal orbit equivalence relation induce by a Polish group on a standard Borel space. In the second part, we compare the relative complexity of various types of classification problems concerning subspaces of [0,1]^n for all natural number n. In the last …
more
Date:
May 2016
Creator:
Chang, Cheng
Partner:
UNT Libraries