1. The Borel complexity of the class of models of first-order theories [ DOI ]
    with Uri Andrews, David Gonzalez, Steffen Lempp, and Hongyu Zhu
    submitted for publication (2024)
  2. Learning Families of Algebraic Structures from Text [ DOI ]
    with Nikolay Bazhenov, Ekaterina Fokina, Alexandra Soskova, and Stefan Vatev
    submitted for publication (2024)
  3. Scott sentence complexities of linear orderings [ DOI | arXiv ]
    with David Gonzalez
    submitted for publication (2023)
  4. A Lopez-Escobar Theorem for Continuous Domains [ DOI | arXiv ]
    with Nikolay Bazhenov, Ekaterina Fokina, Alexandra A. Soskova, and Stefan V. Vatev
    submitted for publication (2023)
  5. The structural complexity of models of arithmetic [ DOI | arXiv ]
    with Antonio Montalbán
    The Journal of Symbolic Logic (2023)
  6. Degrees of categoricity and treeable degrees [ DOI | arXiv ]
    with Barbara F. Csima
    Journal of Mathematical Logic (2023)
  7. Relations enumerable from positive information [ DOI | arXiv ]
    with Barbara F. Csima, and Luke MacLean
    submitted for publication (2022)
  8. Degree spectra of analytic complete equivalence relations [ DOI | arXiv ]
    The Journal of Symbolic Logic vol. 87 (4) , 1663-1676 (2022)
  9. On bi-embeddable categoricity of algebraic structures [ DOI | arXiv ]
    with Nikolay Bazhenov, and Maxim Zubkov
    Annals of Pure and Applied Logic vol. 173 (3) , 103060 (2022)
  10. Degrees of bi-embeddable categoricity [ DOI | arXiv ]
    with Nikolay Bazhenov, Ekaterina Fokina, and Luca San Mauro
    Computability vol. 10 (1) , 1–16 (2021)
  11. Positive enumerable functors [ DOI | arXiv ]
    with Barbara F. Csima, and Daniel Yu
    Conference on Computability in Europe, 385–394 (2021)
  12. The complexity of Scott sentences of scattered linear orders [ DOI | arXiv ]
    with Rachael Alvir
    The Journal of Symbolic Logic vol. 85 (3) , 1079–1101 (2020)
  13. Measuring the complexity of reductions between equivalence relations [ DOI | arXiv ]
    with Ekaterina Fokina, and Luca San Mauro
    Computability vol. 8 (3-4) , 265–280 (2019)
  14. Degrees of bi-embeddable categoricity of equivalence structures [ DOI | arXiv ]
    with Nikolay Bazhenov, Ekaterina Fokina, and Luca San Mauro
    Archive for Mathematical Logic vol. 58 (5-6) , 543–563 (2019)
  15. Bi-embeddability spectra and bases of spectra [ DOI | arXiv ]
    with Ekaterina Fokina, and Luca San Mauro
    Mathematical Logic Quarterly vol. 65 (2) , 228–236 (2019)
  16. Computable bi-embeddable categoricity [ DOI | arXiv ]
    with Nikolay Alekseevich Bazhenov, Ekaterina Fokina, and Luca San Mauro
    Algebra and Logic vol. 57 (5) , 392–396 (2018)
  17. Elementary bi-embeddability spectra of structures [ DOI ]
    Conference on Computability in Europe, 349-358 (2018)
  18. On functors enumerating structures [ DOI | arXiv ]
    Siberian Electronic Mathematical Reports vol. 14 (2017)
  19. Reducibility and bi-reducibility spectra of equivalence relations
    with Ekaterina Fokina, and Luca San Mauro
    Proc. of the 11th Panhellenic Logic Symposium, 83-89 (2017)
  20. Degree Spectra of Structures with Respect to the Bi-embeddability Relation
    with Ekaterina Fokina, and Luca San Mauro
    Proc. of the 11th Panhellenic Logic Symposium, 32-38 (2017)
  21. Computable bi-embeddable categoricity of equivalence structures
    with Nikolay Bazhenov, Ekaterina Fokina, and Luca San Mauro
    Proc. of the 11th Panhellenic Logic Symposium, 126-132 (2017)