Fine hierarchy and definable index sets

DOI10.1007/BF02018741zbMath0780.03019OpenAlexW1966152993MaRDI QIDQ2366368

Victor L. Selivanov

Publication date: 29 June 1993

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

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

zbMATH Keywords

universalityr.e. setsfine hierarchy\(m\)-degrees of definable index setsnumberings of recursively enumerable Boolean algebrasr.e. \(m\)- degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Related Items (8)

On recursively enumerable structures ⋮ Fine hierarchy of regular \(\omega\)-languages ⋮ Fine hierarchy of regular ω-languages ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Ranked structures and arithmetic transfinite recursion ⋮ Boolean algebras, Tarski invariants, and index sets ⋮ Precomplete numberings ⋮ Index sets for \(\Pi^0_1\) classes

Cites Work

• Arithmetic hierarchy and ideals of enumerated Boolean algebras
• The computable enumerations of families of general recursive functions
• The Boolean algebra of logic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fine hierarchy and definable index sets