arXiv:2402.05744 [math.LO]AbstractReferencesReviewsResources
Learning Families of Algebraic Structures from Text
Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, Alexandra Soskova, Stefan Vatev
Published 2024-02-08Version 1
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 of structures. We show that a family of structures is learnable from text if and only if the structures can be distinguished in terms of their theories restricted to positive infinitary $\Sigma_2$ sentences.
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:1905.01601 [math.LO] (Published 2019-05-05)
Learning families of algebraic structures from informant
arXiv:2005.07829 [math.LO] (Published 2020-05-15)
On bi-embeddable categoricity of algebraic structures
arXiv:2001.06204 [math.LO] (Published 2020-01-17)
A Note on Computable Embeddings for Ordinals and Their Reverses