ON $tt$-DEGREES OF RECURSIVELY ENUMERABLE TURING DEGREES

DOI10.1070/SM1979v035n02ABEH001463zbMath0419.03026OpenAlexW2083469660MaRDI QIDQ3852170

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

recursive setshyperhypersimple 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)

Related Items (2)

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

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