Hierarchies of hyperarithmetical sets and functions

DOI10.1007/BF01978879zbMATH Open0548.03022OpenAlexW2059552448MaRDI QIDQ799667FDOQ799667

Authors: Victor 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (18)

• Logic vs topology on regular \(\omega \)-languages
• Towards a descriptive theory of cb\(_{0}\)-spaces
• Effective wadge hierarchy in computable quasi-Polish spaces
• Fine hierarchies via Priestley duality
• Hyperarithmetical Sets
• Fine hierarchy of regular \(\omega\)-languages
• Turing degrees in refinements of the arithmetical hierarchy
• Wadge Degrees ofω-Languages of Deterministic Turing Machines
• Hierarchies of finite sets
• Fine hierarchy of regular \(\omega\)-languages
• On recursively enumerable structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-collapse of the effective Wadge hierarchy
• Well-Quasi Orders and Hierarchy Theory
• Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
• Extending Wadge theory to \(k\)-partitions
• Non-collapse of the effective wadge hierarchy

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799667)