On the Wadge Reducibility of k-Partitions

DOI10.1016/j.entcs.2008.03.008zbMath1262.03102OpenAlexW2054000597MaRDI QIDQ4918030

Victor L. Selivanov

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

zbMATH Keywords

Baire spaceforest\(k\)-partitionWadge reducibilityBaire domaindiscrete weak semilatticehomomorphic preorder

Mathematics Subject Classification ID

Descriptive set theory (03E15) Undecidability and degrees of sets of sentences (03D35) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (5)

On the main scientific achievements of Victor Selivanov ⋮ Extending Wagner's hierarchy to deterministic visibly pushdown automata ⋮ Definability in the \(h\)-quasiorder of labeled forests ⋮ On the Wadge reducibility of \(k\)-partitions ⋮ Complexity issues for the iterated \(h\)-preorders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: On the Wadge Reducibility of k-Partitions