On arithmetical level of the class of superhigh sets

DOI10.3103/S1066369X14050053zbMathNoneOpenAlexW1977541285MaRDI QIDQ465108

M. Kh. Faizrakhmanov

Publication date: 31 October 2014

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x14050053

zbMATH Keywords

arithmetical hierarchyarithmetical classsuperhigh set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Cites Work

• Characterizing the strongly jump-traceable sets via randomness
• Superhighness
• Strong jump-traceability. I: The computably enumerable case
• A Refinement of Lown and Highn for the R.E. Degrees
• Almost everywhere domination
• Unnamed Item
• Unnamed Item