A minimal upper bound on a sequence of Turing degrees which represents that sequence

DOI10.2140/PJM.1983.108.115zbMath0546.03023OpenAlexW1995411817MaRDI QIDQ798318

Harold T. Hodes

Publication date: 1983

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1983.108.115

zbMATH Keywords

Turing degreesminimal upper bound

Mathematics Subject Classification ID

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

This page was built for publication: A minimal upper bound on a sequence of Turing degrees which represents that sequence