7 citations · 14 across the 5 of their papers we have counts for
Showing 2019 · math.LOShow all
2 papers · 2 filters
math.LO2019★ 7 cited
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.LO2019★ 2 cited
Computable embeddings for pairs of linear orders
Nikolay Bazhenov, Hristo Ganchev, Stefan Vatev
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orde…