7 citations · 14 across the 5 of their papers we have counts for
5 papers
Learning Families of Algebraic Structures from Text
Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger +2
We adapt the classical notion of learning from text to computable structure theory. Our main result is a model-theoretic characterization of the learnability from text for classes…
A Lopez-Escobar Theorem for Continuous Domains
Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger +2
We prove an effective version of the Lopez-Escobar theorem for continuous domains. Let be the set of countable structures with universe in vocabulary topologized b…
On bi-embeddable categoricity of algebraic structures
Nikolay Bazhenov, Dino Rossegger, Maxim Zubkov
In several classes of countable structures it is known that every hyperarithmetic structure has a computable presentation up to bi-embeddability. In this article we investigate the…
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…
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…