Taking the path computably travelled
Logic
2019-05-30 v1
Abstract
We define a real to be low for paths in Baire space (or Cantor space) if every class with an -computable element has a computable element. We prove that lowness for paths in Baire space and lowness for paths in Cantor space are equivalent and, furthermore, that these notions are also equivalent to lowness for isomorphism.
Keywords
Cite
@article{arxiv.1905.12199,
title = {Taking the path computably travelled},
author = {Johanna N. Y. Franklin and Dan Turetsky},
journal= {arXiv preprint arXiv:1905.12199},
year = {2019}
}