معرفی
Andrea Sorbi is a Professor at the Department of Information Engineering and Mathematical Sciences, University of Siena, where he teaches Mathematical Logic courses for undergraduate and graduate programs including "LOGICA MATEMATICA" for third-year Mathematics students and "MATHEMATICAL LOGIC" for Master's students in Applied Mathematics across multiple academic years (2021/2022–2025/2026).
His research specializes in Mathematical Logic with emphasis on Computability Theory and Recursion Theory, investigating structural properties of enumeration degrees, reducibilities, and degrees of unsolvability. Key focus areas include singleton degrees, Sigma-0-2 sets, and algebraic word problems analyzed through computable reducibility frameworks.
Recent publications demonstrate sustained contributions to degree theory, revealing non-density properties in Sigma-0-2 sets, minimal degree structures in positive reducibilities, and classification methods for algebraic word problems. His work appears consistently in premier venues like the Annals of Pure and Applied Logic and Journal of Logic and Computation.
Office hours are held Tuesdays 14:00–16:00 and Wednesdays 14:00–18:00 in Room 220 of the San Niccolò Building (Via Roma 56, Siena). Contact: andrea.sorbi@unisi.it, +39 0577233711 (int. 3711).
