Completely Autoreducible Degrees

DOI10.1002/MALQ.19760220164MaRDI QIDQ4163202zbMATH OpenOpenAlexFDO

Authors Carl G. jun. Jockusch, Michael S. Paterson

Publication date 1976

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19760220164

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(2)

• Completely mitotic r. e. degrees
• Constructive logic and the Medvedev lattice

This page was built for publication: Completely Autoreducible Degrees

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