×

zbMATH — the first resource for mathematics

Lowness for isomorphism, countable ideals, and computable traceability. (English) Zbl 07206430
Summary: We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair construction. We further show that within the hyperimmune free degrees, lowness for isomorphism is entirely independent of computable traceability.
MSC:
03 Mathematical logic and foundations
PDF BibTeX XML Cite
Full Text: DOI