Publications

28Total publications

3Preprints

18Journal articles

7Conference papers

14Last 3 years

1. Hausdorff dimension and countable Borel equivalence relationsDOIarXiv
   Andrew Marks, Dino Rossegger, and Theodore Slaman
   Proceedings of the American Mathematical Society, vol. 154 (2), pp. 883-892 (2026)
2. Dichotomy results for classes of countable graphsDOIarXiv
   Vittorio Cipriani, Ekaterina Fokina, Matthew Harrison-Trainor, Liling Ko, and Dino Rossegger
   submitted for publication (2025)
3. Uniformity in learning structuresDOIarXiv
   Vittorio Cipriani and Dino Rossegger
   submitted for publication (2025)
4. Scott sentence complexities of linear orderingsDOIarXiv
   David Gonzalez and Dino Rossegger
   The Journal of Symbolic Logic, vol. 90 (4), pp. 1563-1592 (2025)
5. The Borel complexity of the class of models of first-order theoriesDOIarXiv
   Uri Andrews, David Gonzalez, Steffen Lempp, Dino Rossegger, and Hongyu Zhu
   Proceedings of the American Mathematical Society, vol. 153 (09), pp. 4013-4024 (2025)
6. Classifying the complexity of models of arithmeticDOIarXiv
   David Gonzalez, Mateusz Łełyk, Dino Rossegger, and Patryk Szlufik
   submitted for publication (2025)
7. Feferman's completeness theoremDOIarXiv
   Fedor Pakhomov, Michael Rathjen, and Dino Rossegger
   Bulletin of Symbolic Logic, vol. 31 (3), pp. 462-487 (2025)
8. Relations enumerable from positive informationDOIarXiv
   Barbara F Csima, Luke MacLean, and Dino Rossegger
   Journal of Logic and Computation, vol. 35 (5), pp. 1-15 (2025)
9. Learning Equivalence Relations on Polish SpacesDOIarXiv
   Dino Rossegger, Theodore Slaman, and Tomasz Steifer
   The Journal of Symbolic Logic, vol. first view, pp. 1-19 (2025)
10. A Lopez-Escobar Theorem for Continuous DomainsDOIarXiv
    Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, Alexandra Soskova, and Stefan Vatev
    The Journal of Symbolic Logic, vol. 90 (2), pp. 854-871 (2025)
11. Degrees of categoricity and treeable degreesDOIarXiv
    Barbara F. Csima and Dino Rossegger
    Journal of Mathematical Logic, vol. 24 (03), pp. 2450002 (2024)
12. Learning Families of Algebraic Structures from TextDOIarXiv
    Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, Alexandra Soskova, and Stefan Vatev
    Twenty Years of Theoretical and Practical Synergies, Computability in Europe, Lecture Notes in Computer Science, vol. 14773, pp. 166-178 (2024)
13. Algorithmic Aspects of Left-Orderings of Solvable Baumslag–Solitar Groups via its Dynamical RealizationDOIarXiv
    Meng-Che “Turbo” Ho, Khanh Le, and Dino Rossegger
    Twenty Years of Theoretical and Practical Synergies, Computability in Europe, Lecture Notes in Computer Science, vol. 14773, pp. 72-84 (2024)
14. The structural complexity of models of arithmeticDOIarXiv
    Antonio Montalbán and Dino Rossegger
    The Journal of Symbolic Logic, vol. 89 (4), pp. 1703-1719 (2024)
15. On bi-embeddable categoricity of algebraic structuresDOIarXiv
    Nikolay Bazhenov, Dino Rossegger, and Maxim Zubkov
    Annals of Pure and Applied Logic, vol. 173 (3), pp. 103060 (2022)
16. Degree spectra of analytic complete equivalence relationsDOIarXiv
    Dino Rossegger
    The Journal of Symbolic Logic, vol. 87 (4), pp. 1663-1676 (2022)
17. Positive enumerable functorsDOIarXiv
    Barbara F. Csima, Dino Rossegger, and Daniel Yu
    Connecting with Computability, Computability in Europe, Lecture Notes in Computer Science, vol. 12813, pp. 385–394 (2021)
18. Degrees of bi-embeddable categoricityDOIarXiv
    Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Computability, vol. 10 (1), pp. 1–16 (2021)
19. The complexity of Scott sentences of scattered linear ordersDOIarXiv
    Rachael Alvir and Dino Rossegger
    The Journal of Symbolic Logic, vol. 85 (3), pp. 1079–1101 (2020)
20. Measuring the complexity of reductions between equivalence relationsDOIarXiv
    Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Computability, vol. 8 (3-4), pp. 265–280 (2019)
21. Degrees of bi-embeddable categoricity of equivalence structuresDOIarXiv
    Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Archive for Mathematical Logic, vol. 58 (5-6), pp. 543–563 (2019)
22. Bi-embeddability spectra and bases of spectraDOIarXiv
    Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Mathematical Logic Quarterly, vol. 65 (2), pp. 228–236 (2019)
23. Computable bi-embeddable categoricityDOIarXiv
    Nikolay Alekseevich Bazhenov, Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Algebra and Logic, vol. 57 (5), pp. 392–396 (2018)
24. Elementary bi-embeddability spectra of structuresDOI
    Dino Rossegger
    Sailing Routes in the World of Computation, Computability in Europe, Lecture Notes in Computer Science, vol. 10936, pp. 349-358 (2018)
25. Computable bi-embeddable categoricity of equivalence structures
    Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Proc. of the 11th Panhellenic Logic Symposium, 11th Panhellenic Logic Symposium, vol. , pp. 126-132 (2017)
26. On functors enumerating structuresDOIarXiv
    Dino Rossegger
    Siberian Electronic Mathematical Reports, vol. 14, pp. 690-702 (2017)
27. Reducibility and bi-reducibility spectra of equivalence relations
    Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Proc. of the 11th Panhellenic Logic Symposium, 11th Panhellenic Logic Symposium, vol. , pp. 83-89 (2017)
28. Degree Spectra of Structures with Respect to the Bi-embeddability Relation
    Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Proc. of the 11th Panhellenic Logic Symposium, 11th Panhellenic Logic Symposium, vol. , pp. 32-38 (2017)