Degrees that Are Low for Isomorphism
Johanna N. Y. Franklin, Reed Solomon · Computability · 2014
We say that a degree is low for isomorphism if, whenever it can compute an isomorphism between a pair of computable structures, there is already a computable isomorphism between them. We show that while there is no clear-cut relationship between this