Hierarchies of hyperarithmetical sets and functions

DOI10.1007/BF01978879MaRDI QIDQ799667zbMATH OpenOpenAlexFDO

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

hierarchy of setsm-reducibility

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Review text

Translation from Algebra Logika 22, No.6, 666-692 (Russian) (1983; Zbl 0536.03025).

Cited in

(18)

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

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)