10 citations · 17 across the 12 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
math.LO2024
Hausdorff dimension and countable Borel equivalence relations
Andrew Marks, Dino Rossegger, Theodore Slaman
We show that if is a countable Borel equivalence relation on , then there is a closed subset of Hausdorff dimension so that $E \restrictio…
math.LO2024★ 1 cited
Learning Equivalence Relations on Polish Spaces
Dino Rossegger, Theodore Slaman, Tomasz Steifer
We investigate natural variations of behaviourally correct learning and explanatory learning -- two learning paradigms studied in algorithmic learning theory -- that allow us to ``…
math.LO2024★ 1 cited
The Borel complexity of the class of models of first-order theories
Uri Andrews, David Gonzalez, Steffen Lempp +2
We investigate the descriptive complexity of the set of models of first-order theories. Using classical results of Knight and Solovay, we give a sharp condition for complete theori…