Hereditary sets and tabular reducibility

DOI10.1007/BF02218609zbMath0283.02035OpenAlexW1993152974MaRDI QIDQ1844219

A. N. Degtev

Publication date: 1973

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

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

The ibT degrees of computably enumerable sets are not dense, T-Degrees, Jump Classes, and Strong Reducibilities, Strong reducibilities

Cites Work

• Retraceable Sets
• Relationships Between Reducibilities
• Semirecursive Sets and Positive Reducibility