Minimal 1-degrees and truth-table reducibility

DOI10.1007/BF00966373zbMath0404.03030OpenAlexW2058916306MaRDI QIDQ1256447

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)

Related Items (1)

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

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