Wesley Calvert's headshot

Wesley Calvert

Professor
wcalvert@siu.edu
618-453-6582
Neckers 387
Mathematics, Statistics

Research Interests

  • Mathematical logic and its applications, especially computability theory and model theory
  • Logic and Probability, including applications to machine learning
  • Definability, Decidability, and Computability in number theory
  • Theoretical computer science

Education

  • Ph.D., University of Notre Dame, 2005.

Selected Publications:

  1. "Comparison of classes of finite structures," with D. Cummins, J. F. Knight, and S. Miller, Algebra and Logic 43 (2004) 374--392.
  2. "Effective categoricity of equivalence structures," with D. Cenzer, V. Harizanov, ad A. Morozov, Annals of Pure and Applied Logic 141 (2006) 61--78.
  3. "PAC learning, VC dimension, and the arithmetic hierarchy," Archive for Mathematical Logic 54 (2015) 871--883.
  4. "Structural highness notions," with J. N. Y. Franklin and D. Turetsky, Journal of Symbolic Logic 84 (2023) 1692--1724.
  5. "Computability in infinite Galois theory and algorithmically random algebraic fields," with V. Harizanov and A. Shlapentokh, Journal of the London Mathematical Society 110 (2024) e70017.
  6. "Generically computable linear orderings," with D. Cenzer, D. Gonzalez, and V. Harizanov Annals of Pure and Applied Logic 176 (2025), 103612
  7. "Normality, relativization, and randomness," with E. Gruner, E. Mayordomo, D. Turetsky, and J. D. Villano, Theory of Computing Systems 69 (2025), 26.