On degrees of recursively enumerable sets

DOI10.1007/BF00967953zbMath0275.02039MaRDI QIDQ2265426

S. Kallibekov

Publication date: 1973

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees ⋮ On btt-reducibilities. II ⋮ Application of precomplete enumerations to tabular-type degrees and index sets ⋮ Precomplete numberings ⋮ Strong reducibilities

Cites Work

• Index sets of degrees of unsolvability
• Degrees of Unsolvability. (AM-55)
• Unnamed Item