Remarks on retracable, regressive, and pointwise-decomposable sets

DOI10.1007/BF02219042zbMath0239.02023OpenAlexW2043599054MaRDI QIDQ2553433

A. N. Degtev

Publication date: 1972

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

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

Mathematics Subject Classification ID

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

Cites Work

• Strong reductibility on hypersimple sets
• Recursively Enumerable Sets and Retracing Functions
• Splinters of recursive functions
• Retraceable Sets and Recursive Permutations
• On Properties of Regressive Sets
• A theorem on hyperhypersimple sets
• On Pseudo‐Creative Sets, Splinters, and Bounded‐Truth‐Table Reducibility

This page was built for publication: Remarks on retracable, regressive, and pointwise-decomposable sets