Non-collapse of the effective Wadge hierarchy
نویسندگان
چکیده
We study the recently suggested effective Wadge hierarchy in spaces, concentrating on non-collapse property. Along with hierarchies of sets, we k-partitions which are interesting their own. In particular, establish sufficient conditions for and apply them to some concrete including discrete space natural numbers, Baire space, Cantor space. While latter two cases obtained by easy effectivization corresponding topological result T. Kihara A. Montalban, first case needs a different technique is certainly main technical this paper.
منابع مشابه
Pointwise convergence and the Wadge hierarchy
We show that if X is a Σ 1 separable metrizable space which is not σ-compact then C p (X), the space of bounded real-valued continuous functions on X with the topology of pointwise convergence, is Borel-Π 1 -complete. Assuming projective determinacy we show that if X is projective not σ-compact and n is least such that X is Σ1n then Cp(X), the space of real-valued continuous functions on X with...
متن کاملFixpoint alternation and the Wadge hierarchy
In [2] Bradfield found a link between finite differences formed by Σ2 sets and the mu-arithmetic introduced by Lubarski [10]. We extend this approach into the transfinite: in allowing countable disjunctions we show that this kind of extended mu-calculus matches neatly to the transfinite difference hierarchy of Σ2 sets. The difference hierarchy is intimately related to parity games. When passing...
متن کاملThe Wadge Hierarchy of Max-Regular Languages
Recently, Mikołaj Bojańczyk introduced a class of max-regular languages, an extension of regular languages of infinite words preserving many of its usual properties. This new class can be seen as a different way of generalizing the notion of regularity from finite to infinite words. This paper compares regular and max-regular languages in terms of topological complexity. It is proved that up to...
متن کاملThe Wadge Hierarchy of Deterministic Tree Languages
We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to another. This extends Wagner’s results on the hierarchy of ω-regular languages of words to the case of trees.
متن کاملWadge hierarchy of omega context-free languages
The main result of this paper is that the length of the Wadge hierarchy of omega context-free languages is greater than the Cantor ordinal 0, and the same result holds for the conciliating Wadge hierarchy, de1ned by Duparc (J. Symbolic Logic, to appear), of in1nitary context-free languages, studied by Beauquier (Ph.D. Thesis, Universit9 e Paris 7, 1984). In the course of our proof, we get resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computability
سال: 2022
ISSN: ['2211-3576', '2211-3568']
DOI: https://doi.org/10.3233/com-210376