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

DOI10.2140/PJM.1983.108.115zbMATH Open0546.03023OpenAlexW1995411817MaRDI QIDQ798318FDOQ798318

Authors: 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

Recommendations

• scientific article; zbMATH DE number 800099
• Minimal upper bounds for arithmetical degrees
• Upper bounds on ideals in the computably enumerable Turing degrees
• η-representation of sets and degrees
• Constructing minimal pairs of degrees

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

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