3 papers
math.LO2019
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…
math.LO2018
Bi-embeddability spectra and bases of spectra
Ekaterina Fokina, Dino Rossegger, Luca San Mauro
We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddab…
math.LO2018
Measuring the complexity of reductions between equivalence relations
Ekaterina Fokina, Dino Rossegger, Luca San Mauro
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reduc…