Degrees of bi-embeddable categoricity of equivalence structures

Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger +1

We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) ${\Delta }_{\alpha }^0$ b…