ON tt-DEGREES OF RECURSIVELY ENUMERABLE TURING DEGREES

DOI10.1070/SM1979V035N02ABEH001463MaRDI QIDQ3852170zbMATH OpenOpenAlexFDO

Authors G. N. Kobzev

Publication date 1979

Published in Mathematics of the USSR-Sbornik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/sm1979v035n02abeh001463

zbMATH Keywords

hyperhypersimple setsrecursive setsrecursively enumerable Turing degreessemilattice of tt-degrees

Mathematics Subject Classification ID

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

Cited in

(2)

• The ibT degrees of computably enumerable sets are not dense
• Degree theoretic definitions of the low₂ recursively enumerable sets

This page was built for publication: ON $tt$-DEGREES OF RECURSIVELY ENUMERABLE TURING DEGREES

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