Degrees that Are Low for Isomorphism
From MaRDI portal
Publication:5175617
DOI10.3233/COM-140027zbMath1322.03028OpenAlexW796272647MaRDI QIDQ5175617
Johanna N. Y. Franklin, D. Reed Solomon
Publication date: 24 February 2015
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-140027
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28) Algorithmic randomness and dimension (03D32)
Related Items
STRUCTURAL HIGHNESS NOTIONS ⋮ Lowness for isomorphism, countable ideals, and computable traceability ⋮ Strength and Weakness in Computable Structure Theory ⋮ Strong degrees of categoricity and weak density ⋮ Lowness for difference tests ⋮ Degrees of and lowness for isometric isomorphism ⋮ Categoricity spectra of computable structures ⋮ Coding in the automorphism group of a computably categorical structure ⋮ Degrees of bi-embeddable categoricity