On the Wadge Reducibility of k-Partitions

Authors:
Victor Selivanov
Affiliations:
A.P. Ershov Institute of Informatics Systems, Siberian Division Russian Academy of Sciences, and Theoretische Informatik, Universität Würzburg
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 5
Cited 1

Domain theory

Handbook of logic in computer science (vol. 3)
Towards a descriptive set theory for domain-like structures

Theoretical Computer Science - Spatial representation: Discrete vs. continous computational models
Definability in the Homomorphic Quasiorder of Finite Labeled Forests

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
A Useful Undecidable Theory

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Undecidability in the homomorphic quasiorder of finite labeled forests

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers

Fine hierarchies and m-reducibilities in theoretical computer science

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We establish some results on the Wadge degrees and on the Boolean hierarchy of k-partitions of some spaces, where k is a natural number. The main attention is paid to the Baire space, Baire domain and their close relatives. For the case of @D"2^0-measurable k-partitions the structures of Wadge degrees are characterized completely. For many degree structures, undecidability of the first-order theories is shown, for any k=3.