Relative enumerability in the difference hierarchy

DOI10.2307/2586839MaRDI QIDQ4212911zbMATH OpenOpenAlexFDO

Authors Theodore A. Slaman, M. M. Arslanov, Geoffrey L. LaForte

Publication date 27 April 1999

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2586839

zbMATH Keywords

difference hierarchyREA hierarchy

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Recommendations

• Relative enumerability in Ershov's hierarchy
• scientific article; zbMATH DE number 3995652
• scientific article; zbMATH DE number 4091487
• Differences of Computably Enumerable Sets
• On the problem of definability of the computably enumerable degrees in the difference hierarchy
• scientific article; zbMATH DE number 1543034
• Iterated relative recursive enumerability
• Relative enumerability and 1-genericity
• Relative recursive enumerability of generic degrees
• On relative enumerability of Turing degrees

Cites work

• Iterated relative recursive enumerability
• Weak density and cupping in the d-r.e. degrees

Cited in

(20)

• Iterated relative recursive enumerability
• On relative enumerability of Turing degrees
• Isolation in the CEA hierarchy
• Nonisolated degrees and the jump operator
• Weak density and nondensity among transfinite levels of the Ershov hierarchy
• Turing computability: structural theory
• \textit{CEA} operators and the ershov hierarchy
• A survey of results on the d.c.e. and \(n\)-c.e. degrees
• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• Relative enumerability in Ershov's hierarchy
• A survey of results on the d-c.e. and n-c.e. degrees
• On a problem of Ishmukhametov
• scientific article; zbMATH DE number 4091487 (Why is no real title available?)
• scientific article; zbMATH DE number 2154088 (Why is no real title available?)
• A relationship between difference hierarchies and relativized polynomial hierarchies
• There are no maximal low d.c.e. degrees
• Normalizing notations in the Ershov hierarchy
• Degrees of selector functions and relative computable categoricity
• Marat Mirzaevich Arslanov (on his eightieth birthday)
• \textit{CEA}-operators and the Ershov hierarchy. I

This page was built for publication: Relative enumerability in the difference hierarchy

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