We investigate different notions of "computable topological base" for represented spaces. We show that several non-equivalent notions of bases become equivalent when we consider computably enumerable bases. This indicates the existence of a robust notion of computably second countable represented space. These spaces are precisely those introduced by Grubba and Weihrauch under the name "computable topological spaces". The present work thus clarifies the articulation between Schröder's approach to computable topology based on the Sierpinski representation and other approaches based on notions of computable bases. These other approaches turn out to be compatible with the Sierpinski representation approach, but also strictly less general. We revisit Schröder's Effective Metrization Theorem, by showing that it characterizes those represented spaces that embed into computable metric spaces: those are the computably second countable strongly computably regular represented spaces. Finally, we study different forms of open choice problems. We show that having a computable open choice is equivalent to being computably separable, but that the "non-total open choice problem", i.e., open choice restricted to open sets that have non-empty complement, interacts with effective second countability in a satisfying way.

翻译：暂无翻译