tt- and m-degrees

DOI10.1007/BF02219290zbMath0338.02023OpenAlexW1995383554MaRDI QIDQ1230623

A. N. Degtev

Publication date: 1974

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219290

Mathematics Subject Classification ID

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

Related Items

On multiple positive reducibility, Degree theoretic definitions of the low₂ recursively enumerable sets, Irreducible, singular, and contiguous degrees, Computably enumerable sets and related issues, On the congruence of the upper semilattices of recursively enumerable m- powers and tabular powers, On \(1\)-degrees inside \(m\)-degrees, Recursive versus recursively enumerable binary relations

Cites Work

• Retraceable Sets
• Recursively Enumerable Sets and Retracing Functions
• Linear orderings under one-one reducibility
• Semirecursive Sets and Positive Reducibility
• Recursively enumerable sets of positive integers and their decision problems