We investigate the descriptive complexity of connectedness (and also pathwise connectedness and local connectedness) of Polish spaces, and prove that even in the framework of finite-dimensional euclidean spaces this complexity can be the highest possible,
No takes yet. Share an insight, caveat, or question.
Debs et al. (2019) studied this question.