A Friedberg enumeration of equivalence structures

Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
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