A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Friedberg enumeration of equivalence structures
2017
Journal of Mathematical Logic
We solve a problem posed by Goncharov and Knight [Problem 4 in [GK02]]. More specifically, we produce an e↵ective Friedberg (i.e., injective) enumeration of computable equivalence structures, up to isomorphism. We also prove that there exists an e↵ective Friedberg enumeration of all isomorphism types of infinite computable equivalence structures.
doi:10.1142/s0219061317500088
fatcat:zhvnxrd5jve3roofqu42sfx4lm