Wadge-like reducibilities on arbitrary quasi-Polish spaces

DOI10.1017/S0960129513000339zbMath1362.03042arXiv1204.5338OpenAlexW3103691847MaRDI QIDQ5740679

Luca Motto Ros, Philipp Schlicht, Victor L. Selivanov

Publication date: 27 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.5338

Mathematics Subject Classification ID

Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (21)

Descriptive set theory, from Cantor to Wadge and beyond ⋮ Towards the Effective Descriptive Set Theory ⋮ Unnamed Item ⋮ Wadge-like degrees of Borel bqo-valued functions ⋮ The Wadge hierarchy on Zariski topologies ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ Towards a descriptive theory of cb₀-spaces ⋮ THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ On the main scientific achievements of Victor Selivanov ⋮ Borel-Piecewise Continuous Reducibility for Uniformization Problems ⋮ Borel subsets of the real line and continuous reducibility ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ A Wadge hierarchy for second countable spaces ⋮ Continuous reducibility and dimension of metric spaces ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Decomposing Borel functions using the Shore–Slaman join theorem ⋮ On the widest class of completeness-preserving covering maps ⋮ Point Degree Spectra of Represented Spaces ⋮ Input-driven pushdown automata on well-nested infinite strings

Cites Work

• Unnamed Item
• \(\sigma\)-homogeneity of Borel sets
• Beyond Borel-amenability: scales and superamenable reducibilities
• Decomposing Borel functions and structure at finite levels of the Baire hierarchy
• More on Wadge determinacy
• A new proof of a theorem of Jayne and Rogers
• Wadge reducibility and infinite computations
• Definability in the \(h\)-quasiorder of labeled forests
• On the Wadge reducibility of \(k\)-partitions
• Quasi-Polish spaces
• Game representations of classes of piecewise definable functions
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
• Undecidability in Weihrauch Degrees
• Borel-amenable reducibilities for sets of reals
• Borel isomorphisms at the first level—I
• Borel isomorphisms at the first level, II
• Decomposing Borel sets and functions and the structure of Baire class 1 functions
• Borel–Wadge degrees
• Continuous Lattices and Domains
• On the Difference Hierarchy in Countably Based T0-Spaces
• Baire reductions and good Borel reducibilities
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• On the Structure of Finite Level and ω-Decomposable Borel Functions
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests

This page was built for publication: Wadge-like reducibilities on arbitrary quasi-Polish spaces