On the Wadge Reducibility of k-Partitions
From MaRDI portal
Publication:4918030
DOI10.1016/j.entcs.2008.03.008zbMath1262.03102MaRDI QIDQ4918030
Publication date: 3 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.008
Baire space; forest; \(k\)-partition; Wadge reducibility; Baire domain; discrete weak semilattice; homomorphic preorder
03E15: Descriptive set theory
03D35: Undecidability and degrees of sets of sentences
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Definability in the \(h\)-quasiorder of labeled forests, On the Wadge reducibility of \(k\)-partitions, Complexity issues for the iterated \(h\)-preorders
Cites Work
- Towards a descriptive set theory for domain-like structures
- Structure of degrees of generalized index sets
- Topology and descriptive set theory
- Hierarchies in?-spaces and applications
- Hierarchies of function classes defined by the first-value operator
- Definability in the Homomorphic Quasiorder of Finite Labeled Forests
- A Useful Undecidable Theory
- Logical Approaches to Computational Barriers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item