7 citations · 20 across the 3 of their papers we have counts for
3 papers
Degrees of bi-embeddable categoricity
Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger +1
We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure…
Classifying equivalence relations in the Ershov hierarchy
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro +2
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\…
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) b…