Taking the path computably traveled

DOI10.1093/LOGCOM/EXZ016MaRDI QIDQ5212561zbMATH OpenOpenAlexWikidataFDO

Authors Johanna N. Y. Franklin, Dan Turetsky

Publication date 29 January 2020

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.12199

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28) Theory of numerations, effectively presented structures (03D45)

Abstract: We define a real $A$ to be low for paths in Baire space (or Cantor space) if every $P{i}_1^0$ 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.

Recommendations

• Degrees of and lowness for isometric isomorphism
• Lowness properties and randomness
• Lowness properties and approximations of the jump
• Lowness and nullsets
• Reals which compute little

Cited in

(4)

• Lowness for isomorphism, countable ideals, and computable traceability
• Degrees of and lowness for isometric isomorphism
• STRUCTURAL HIGHNESS NOTIONS
• COMPUTABLY COMPACT METRIC SPACES

This page was built for publication: Taking the path computably traveled

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