Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations
From MaRDI portal
Publication:5131653
DOI10.3233/COM-190255zbMath1464.03040MaRDI QIDQ5131653
Publication date: 9 November 2020
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-190255
relations; Wadge reducibility; better-quasi-orders; labeled forests; continuous strong Weihrauch reducibility; continuous Weihrauch reducibility
03D30: Other degrees and reducibilities in computability and recursion theory
03D78: Computation over the reals, computable analysis
03D55: Hierarchies of computability and definability
Related Items
Weihrauch Complexity in Computable Analysis, Non-collapse of the effective Wadge hierarchy, A syntactic approach to Borel functions: some extensions of Louveau's theorem, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces