Turing degrees and many-one degrees of maximal sets

DOI10.2307/2271152zbMATH Open0198.02503OpenAlexW4243050924MaRDI QIDQ5596232FDOQ5596232

Authors: Manuel Lerman 

Publication date: 1970

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2271152

zbMATH Keywords

recursion theory, constructive mathematics

Cited In (7)

• Hypersimple sets with retraceable complements
• Strong reducibilities
• Some theorems on R-maximal sets and major subsets of recursively enumerable sets
• Recursively enumerable sets and degrees
• On btt-reducibilities. II
• Index sets of degrees of unsolvability
• btt-reducibility

This page was built for publication: Turing degrees and many-one degrees of maximal sets

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