Research

While my primary interest lies in computable structure theory, this area intersects with many areas in mathematical logic and beyond. In the boldface version of the theory, the analysis is highly structural and resembles countable model theory or, in practice, a sort of countable combinatorics. This relates tightly to problems in descriptive set theory which views these same problems from a topological perspective.

I am also actively working on projects in reverse mathematics, which aims to understand the combinatorial core of proofs and theorems.

Publications and preprints:

  1. Scott Spectral Gaps are Bounded for Linear Orderings (with Matthew Harrison-Trainor)
    Submitted for publication

  2. Scott analysis, linear orders and almost periodic functions (with Matthew Harrison-Trainor and Turbo Ho)
    Submitted for publication

  3. Hybrid Maximal Filter Spaces
    Twenty Years of Theoretical and Practical Synergies, 85–99. Lecture Notes in Comput. Sci., 14773

  4. The Borel Complexity of the Class of Models of First-Order Theories (with U. Andrews, S. Lempp, D. Rossegger and H. Zhu)
    Submitted for publication

  5. Generically Computable Linear Orderings (with W. Calvert, D. Cenzer and V. Harizanov)
    Submitted for publication

  6. The Scott Sentence Complexity of Linear Orders (with D. Rossegger)
    To appear in J. Symb. Log.

  7. The omega-Vaught’s Conjecture (with A. Montalban)
    Trans. Amer. Math. Soc., 376 (2023), no. 8, 5989–6008.

  8. An Upper Bound for the Restricted Online Ramsey Number (with X. He and H. Zheng)
    Discrete Math., 342 (2019), no. 9, 2565-2569

For more information on fellowships, awards and conference talks please refer to my CV. For more information about my research please refer to my research statement.

Previous

Teaching