Hierarchies of Δ02-measurable k -partitions
✍ Scribed by Victor L. Selivanov
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 191 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Attempts to extend the classical Hausdorff difference hierarchy to the case of partitions of a space to k > 2 subsets lead to non‐equivalent notions. In a hope to identify the “right” extension we consider the extensions appeared in the literature so far: the limit‐, level‐, Boolean and Wadge hierarchies of k ‐partitions. The advantages and disadvantages of the four hierarchies are discussed. The main technical contribution of this paper is a complete characterization of the Wadge degrees of Δ^0^~2~‐measurable k ‐partitions of the Baire space. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
📜 SIMILAR VOLUMES
Let G be a graph and n ≥ 2 an integer. We prove that the following are equivalent: (i) there is a partition , and (ii) for every subset S of V (G), G \ S has at most n|S| components with the property that each of their blocks is an odd order complete graph.
We consider the problem of partitioning the vertex-set of a tree to p parts to minimize a cost function. Since the number of partitions is exponential in the number of vertices, it is helpful to identify small classes of partitions which also contain optimal partitions. Two such classes, called cons