Hierarchies of hyperarithmetical sets and functions

DOI10.1007/BF01978879zbMath0548.03022OpenAlexW2059552448MaRDI QIDQ799667

Victor L. Selivanov

Publication date: 1983

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01978879

zbMATH Keywords

m-reducibilityhierarchy of sets

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Related Items (15)

Non-collapse of the effective Wadge hierarchy ⋮ On recursively enumerable structures ⋮ Effective wadge hierarchy in computable quasi-Polish spaces ⋮ Fine hierarchy of regular \(\omega\)-languages ⋮ Fine hierarchy of regular ω-languages ⋮ Towards a descriptive theory of cb₀-spaces ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Logic vs topology on regular \(\omega \)-languages ⋮ Fine hierarchies via Priestley duality ⋮ Unnamed Item ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Turing degrees in refinements of the arithmetical hierarchy ⋮ Extending Wadge theory to \(k\)-partitions ⋮ Wadge Degrees ofω-Languages of Deterministic Turing Machines ⋮ Non-collapse of the effective wadge hierarchy

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Hierarchies of hyperarithmetical sets and functions