20 citations · 54 across the 26 of their papers we have counts for
3 papers · 1 filter
Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro +1
A standard tool for classifying the complexity of equivalence relations on is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The…
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…