Minimal 1-degrees and truth-table reducibility

DOI10.1007/BF00966373MaRDI QIDQ1256447zbMATH OpenOpenAlexFDO

Authors A. N. Degtev

Publication date 1977

Published in Siberian Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

Minimal DegreePseudocreative SetRecursively Enumerable Turing DegreeTruth-Table Reducibility

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(1)

• Some orbits for \({\mathcal E}\)

This page was built for publication: Minimal 1-degrees and truth-table reducibility

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