31Total publications
5Preprints
18Journal articles
8Conference papers
17Last 3 years
  1. A topological highness notion pdf
    Dino Rossegger
    Proceedings of the Panhellenic Logic Symposium, vol. 15, pp. 1-7 (2026)
  2. Scott Analysis below the Vaught Ordinal DOI arXiv
    David Gonzalez, Dino Rossegger, and Dan Turetsky
    submitted for publication (2026)
  3. Structural vs. computational complexity DOI arXiv
    Johanna N. Y. Franklin, Dino Rossegger, and Dan Turetsky
    submitted for publication (2026)
  4. Hausdorff dimension and countable Borel equivalence relations DOI arXiv
    Andrew Marks, Dino Rossegger, and Theodore Slaman
    Proceedings of the American Mathematical Society, vol. 154 (2), pp. 883-892 (2026)
  5. Dichotomy results for classes of countable graphs DOI arXiv
    Vittorio Cipriani, Ekaterina Fokina, Matthew Harrison-Trainor, Liling Ko, and Dino Rossegger
    submitted for publication (2025)
  6. Uniformity in learning structures DOI arXiv
    Vittorio Cipriani and Dino Rossegger
    submitted for publication (2025)
  7. Scott sentence complexities of linear orderings DOI arXiv
    David Gonzalez and Dino Rossegger
    The Journal of Symbolic Logic, vol. 90 (4), pp. 1563-1592 (2025)
  8. The Borel complexity of the class of models of first-order theories DOI arXiv
    Uri Andrews, David Gonzalez, Steffen Lempp, Dino Rossegger, and Hongyu Zhu
    Proceedings of the American Mathematical Society, vol. 153 (09), pp. 4013-4024 (2025)
  9. Classifying the complexity of models of arithmetic DOI arXiv
    David Gonzalez, Mateusz Łełyk, Dino Rossegger, and Patryk Szlufik
    submitted for publication (2025)
  10. Feferman's completeness theorem DOI arXiv
    Fedor Pakhomov, Michael Rathjen, and Dino Rossegger
    Bulletin of Symbolic Logic, vol. 31 (3), pp. 462-487 (2025)
  11. Relations enumerable from positive information DOI arXiv
    Barbara F Csima, Luke MacLean, and Dino Rossegger
    Journal of Logic and Computation, vol. 35 (5), pp. 1-15 (2025)
  12. Learning Equivalence Relations on Polish Spaces DOI arXiv
    Dino Rossegger, Theodore Slaman, and Tomasz Steifer
    The Journal of Symbolic Logic, vol. first view, pp. 1-19 (2025)
  13. A Lopez-Escobar Theorem for Continuous Domains DOI arXiv
    Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, Alexandra Soskova, and Stefan Vatev
    The Journal of Symbolic Logic, vol. 90 (2), pp. 854-871 (2025)
  14. Degrees of categoricity and treeable degrees DOI arXiv
    Barbara F. Csima and Dino Rossegger
    Journal of Mathematical Logic, vol. 24 (03), pp. 2450002 (2024)
  15. Algorithmic Aspects of Left-Orderings of Solvable Baumslag–Solitar Groups via its Dynamical Realization DOI arXiv
    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)
  16. Learning Families of Algebraic Structures from Text DOI arXiv
    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)
  17. The structural complexity of models of arithmetic DOI arXiv
    Antonio Montalbán and Dino Rossegger
    The Journal of Symbolic Logic, vol. 89 (4), pp. 1703-1719 (2024)
  18. On bi-embeddable categoricity of algebraic structures DOI arXiv
    Nikolay Bazhenov, Dino Rossegger, and Maxim Zubkov
    Annals of Pure and Applied Logic, vol. 173 (3), pp. 103060 (2022)
  19. Degree spectra of analytic complete equivalence relations DOI arXiv
    Dino Rossegger
    The Journal of Symbolic Logic, vol. 87 (4), pp. 1663-1676 (2022)
  20. Positive enumerable functors DOI arXiv
    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)
  21. Degrees of bi-embeddable categoricity DOI arXiv
    Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Computability, vol. 10 (1), pp. 1–16 (2021)
  22. The complexity of Scott sentences of scattered linear orders DOI arXiv
    Rachael Alvir and Dino Rossegger
    The Journal of Symbolic Logic, vol. 85 (3), pp. 1079–1101 (2020)
  23. Degrees of bi-embeddable categoricity of equivalence structures DOI arXiv
    Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Archive for Mathematical Logic, vol. 58 (5-6), pp. 543–563 (2019)
  24. Measuring the complexity of reductions between equivalence relations DOI arXiv
    Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Computability, vol. 8 (3-4), pp. 265–280 (2019)
  25. Bi-embeddability spectra and bases of spectra DOI arXiv
    Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Mathematical Logic Quarterly, vol. 65 (2), pp. 228–236 (2019)
  26. Computable bi-embeddable categoricity DOI arXiv
    Nikolay Alekseevich Bazhenov, Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Algebra and Logic, vol. 57 (5), pp. 392–396 (2018)
  27. Elementary bi-embeddability spectra of structures DOI
    Dino Rossegger
    Sailing Routes in the World of Computation, Computability in Europe, Lecture Notes in Computer Science, vol. 10936, pp. 349-358 (2018)
  28. Computable bi-embeddable categoricity of equivalence structures
    Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Proc. of the Panhellenic Logic Symposium, vol. 11, pp. 126-132 (2017)
  29. On functors enumerating structures DOI arXiv
    Dino Rossegger
    Siberian Electronic Mathematical Reports, vol. 14, pp. 690-702 (2017)
  30. Reducibility and bi-reducibility spectra of equivalence relations
    Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Proc. of the Panhellenic Logic Symposium, vol. 11, pp. 83-89 (2017)
  31. Degree Spectra of Structures with Respect to the Bi-embeddability Relation
    Ekaterina Fokina, Dino Rossegger, and Luca San Mauro
    Proc. of the Panhellenic Logic Symposium, vol. 11, pp. 32-38 (2017)