Effective Wadge Hierarchy in Computable Quasi-Polish Spaces

10/29/2019
by   Victor Selivanov, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2021

Constructing the space of valuations of a quasi-Polish space as a space of ideals

We construct the space of valuations on a quasi-Polish space in terms of...
research
03/13/2019

Effective local compactness and the hyperspace of located sets

We revisit the definition of effective local compactness, and propose an...
research
10/08/2020

Finding descending sequences through ill-founded linear orders

In this work we investigate the Weihrauch degree of the problem 𝖣𝖲 of fi...
research
12/21/2020

Ergodic Theorems for PSPACE functions and their converses

We initiate the study of effective pointwise ergodic theorems in resourc...
research
03/02/2019

Computability Aspects of Differential Games in Euclidian Spaces

We study computability-theoretic aspects of differential games. Our focu...
research
03/04/2020

An effective version of definability in metric model theory

In this paper, a computably definable predicate is defined and character...
research
08/11/2017

Normalized Information Distance and the Oscillation Hierarchy

We study the complexity of approximations to the normalized information ...

Please sign up or login with your details

Forgot password? Click here to reset