3 papers
math.LO2024
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…
math.LO2022
The structural complexity of models of arithmetic
Antonio Montalbán, Dino Rossegger
We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than and that non-standard models of…
math.LO2022
Relations enumerable from positive information
Barbara F. Csima, Luke MacLean, Dino Rossegger
We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to…