Fine hierarchy and definable index sets
From MaRDI portal
Publication:2366368
DOI10.1007/BF02018741zbMath0780.03019MaRDI QIDQ2366368
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
universality; r.e. sets; fine hierarchy; \(m\)-degrees of definable index sets; numberings of recursively enumerable Boolean algebras; r.e. \(m\)- degrees
03D25: Recursively (computably) enumerable sets and degrees
03D45: Theory of numerations, effectively presented structures
03D55: Hierarchies of computability and definability
Related Items
Fine hierarchy of regular ω-languages, Ranked structures and arithmetic transfinite recursion, Fine hierarchies and m-reducibilities in theoretical computer science, Fine hierarchy of regular \(\omega\)-languages, Index sets for \(\Pi^0_1\) classes, On recursively enumerable structures, Precomplete numberings, Boolean algebras, Tarski invariants, and index sets
Cites Work