6 citations · 8 across the 4 of their papers we have counts for
3 papers · 2 filters
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…
Learning families of algebraic structures from informant
Nikolay Bazhenov, Ekaterina Fokina, Luca San Mauro
We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization…
Limit Learning Equivalence Structures
Ekaterina Fokina, Timo Kötzing, Luca San Mauro
While most research in Gold-style learning focuses on learning formal languages, we consider the identification of computable structures, specifically equivalence structures. In ou…