The descriptive complexity of connectedness in Polish spaces

Gabriel Debs, Jean Saint Raymond, Jean Saint Raymond · Fundamenta Mathematicae · 2019

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,

Read the paper · More papers on PaperTik