Taking the path computably traveled
From MaRDI portal
Publication:5212561
DOI10.1093/logcom/exz016zbMath1444.03139arXiv1905.12199OpenAlexW2969742659WikidataQ127747252 ScholiaQ127747252MaRDI QIDQ5212561
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
Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)
Related Items (4)
STRUCTURAL HIGHNESS NOTIONS ⋮ Lowness for isomorphism, countable ideals, and computable traceability ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Degrees of and lowness for isometric isomorphism
This page was built for publication: Taking the path computably traveled
