Dino Rossegger

Dino Rossegger is a mathematician working at the Institute of Discrete Mathematics at Technische Universität Wien. He serves as Principal Investigator for the international project "Structural Complexity Measures for Foundational Theories" funded by the Austrian Science Fund. Previously, he completed a Marie Skłodowska Curie fellowship called ACOSE (Algorithmic Complexity of Structural Equivalence Relations) which involved a two-year research phase at UC Berkeley under Antonio Montalbán's supervision followed by a return phase at TU Wien under Ekaterina Fokina's supervision.

His research focuses on computability theory and its interactions with descriptive set theory and model theory. Rossegger investigates fundamental questions about the algorithmic complexity of mathematical structures, particularly examining degrees of categoricity, bi-embeddability spectra, and the relationship between computational and descriptive complexity measures. His work often bridges the gap between pure computability theory and broader mathematical contexts, as evidenced by his publications on linear orderings, models of arithmetic, and equivalence relations.

Rossegger's publication record shows consistent output in top-tier logic journals including the Journal of Symbolic Logic, Proceedings of the American Mathematical Society, and Journal of Mathematical Logic. His recent work demonstrates growing influence in the field of computable structure theory, with particular attention to the interplay between Turing degrees and structural complexity measures. The pattern of his publications reveals a deepening exploration of how computational constraints affect the classification of mathematical structures.

• Marie Skłodowska Curie Global Fellowship recipient
• Principal Investigator for Austrian Science Fund project
• Extensive publication record in mathematical logic journals

Rossegger has taught courses at multiple institutions including Technische Universität Wien, University of California Berkeley, and University of Waterloo. His teaching spans advanced mathematical logic topics, recursion theory, and calculus for honors mathematics students. He has developed comprehensive course materials including detailed notes for computability theory and mathematical logic courses. At TU Wien, he has also taught exercise sessions for first-year mathematics courses for computer scientists. His involvement in the local research seminar at TU Wien and organization of the "Computable Structure Theory and Interactions" conference demonstrates his active engagement with the research community.