14 citations · 39 across the 8 of their papers we have counts for
9 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…
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…
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…
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…
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…
The Effective Theory of Borel Equivalence Relations
Ekaterina B. Fokina, Sy-David Friedman, Asger Tornquist
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-L…