Taking the path computably traveled
2019 ◽
Vol 29
(6)
◽
pp. 969-973
◽
Abstract We define a real $A$ to be low for paths in Baire space (or Cantor space) if every $\varPi ^0_1$ class with an $A$-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.
Keyword(s):
2014 ◽
Vol 7
(3)
◽
pp. 439-454
◽
Keyword(s):
1987 ◽
Vol 52
(3)
◽
pp. 817-818
◽
Keyword(s):
1981 ◽
Vol 12
(2)
◽
pp. 135-140
◽