Remarks on retracable, regressive, and pointwise-decomposable sets

DOI10.1007/BF02219042zbMATH Open0239.02023OpenAlexW2043599054MaRDI QIDQ2553433FDOQ2553433

Authors: 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

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553433)