Lowness for isomorphism, countable ideals, and computable traceability
Logic
2019-09-16 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1909.06003,
title = {Lowness for isomorphism, countable ideals, and computable traceability},
author = {Johanna N. Y. Franklin and Reed Solomon},
journal= {arXiv preprint arXiv:1909.06003},
year = {2019}
}