Lowness for isomorphism and degrees of genericity
From MaRDI portal
Publication:4608443
DOI10.3233/COM-170078zbMath1435.03068MaRDI QIDQ4608443
Dan Turetsky, Johanna N. Y. Franklin
Publication date: 16 March 2018
Published in: Computability (Search for Journal in Brave)
Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)
Related Items (7)
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 ⋮ Categoricity spectra of computable structures ⋮ Coding in the automorphism group of a computably categorical structure ⋮ Degrees of bi-embeddable categoricity
This page was built for publication: Lowness for isomorphism and degrees of genericity