2000 character limit reached
Effective Wadge Hierarchy in Computable Quasi-Polish Spaces
Published 29 Oct 2019 in cs.LO | (1910.13220v2)
Abstract: We define and study an effective version of the Wadge hierarchy in computable quasi-Polish spaces which include most spaces of interest for computable analysis. Along with hierarchies of sets we study hierarchies of k-partitions which are interesting on their own. We show that levels of such hierarchies are preserved by the computable effectively open surjections, that if the effective Hausdorff-Kuratowski theorem holds in the Baire space then it holds in every computable quasi-Polish space, and we extend the effective Hausdorff theorem to k-partitions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.