Feferman's completeness theorem
[ DOI
]
with
Fedor Pakhomov, and
Michael Rathjen
submitted for publication
(2024)
Learning Equivalence Relations on Polish Spaces
[ DOI
|
arXiv
]
with
Theodore Slaman, and
Tomasz Steifer
submitted for publication
(2024)
A Lopez-Escobar Theorem for Continuous Domains
[ DOI
|
arXiv
]
with
Nikolay Bazhenov,
Ekaterina Fokina,
Alexandra Soskova, and
Stefan Vatev
The Journal of Symbolic Logic
vol. First View
(2024)
The Borel complexity of the class of models of first-order theories
[ DOI
|
arXiv
]
with
Uri Andrews,
David Gonzalez,
Steffen Lempp, and
Hongyu Zhu
submitted for publication
(2024)
Algorithmic Aspects of Left-Orderings of Solvable Baumslag–Solitar Groups via its Dynamical Realization
[ DOI
|
arXiv
]
with
Meng-Che “Turbo” Ho, and
Khanh Le
Twenty Years of Theoretical and Practical Synergies,
Computability in Europe, Lecture Notes in Computer Science
vol. 14773, 72-84 (2024)
Learning Families of Algebraic Structures from Text
[ DOI
|
arXiv
]
with
Nikolay Bazhenov,
Ekaterina Fokina,
Alexandra Soskova, and
Stefan Vatev
Twenty Years of Theoretical and Practical Synergies,
Computability in Europe, Lecture Notes in Computer Science
vol. 14773, 166-178 (2024)
Scott sentence complexities of linear orderings
[ DOI
|
arXiv
]
with
David Gonzalez
to appear in Journal of Symbolic Logic
(2023)
Degrees of categoricity and treeable degrees
[ DOI
|
arXiv
]
with
Barbara F. Csima
Journal of Mathematical Logic
(2023)
The structural complexity of models of arithmetic
[ DOI
|
arXiv
]
with
Antonio Montalbán
The Journal of Symbolic Logic
vol. First View
(2023)
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)
Degree spectra of analytic complete equivalence relations
[ DOI
|
arXiv
]
The Journal of Symbolic Logic
vol. 87
(4)
, 1663-1676
(2022)
Relations enumerable from positive information
[ DOI
|
arXiv
]
with
Barbara F. Csima, and
Luke MacLean
submitted for publication
(2022)
Positive enumerable functors
[ DOI
| arXiv
]
with
Barbara F. Csima, and
Daniel Yu
Connecting with Computability,
Computability in Europe, Lecture Notes in Computer Science
vol. 12813, 385–394 (2021)
Degrees of bi-embeddable categoricity
[ DOI
|
arXiv
]
with
Nikolay Bazhenov,
Ekaterina Fokina, and
Luca San Mauro
Computability
vol. 10
(1)
, 1–16
(2021)
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)
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)
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)
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)
Elementary bi-embeddability spectra of structures
[ DOI
]
Sailing Routes in the World of Computation,
Computability in Europe, Lecture Notes in Computer Science
vol. 10936, 349-358 (2018)
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)
Computable bi-embeddable categoricity of equivalence structures
with
Nikolay Bazhenov,
Ekaterina Fokina, and
Luca San Mauro
Proc. of the 11th Panhellenic Logic Symposium,
11th Panhellenic Logic Symposium,
vol. , 126-132 (2017)
On functors enumerating structures
[ DOI
|
arXiv
]
Siberian Electronic Mathematical Reports
vol. 14
(2017)
Reducibility and bi-reducibility spectra of equivalence relations
with
Ekaterina Fokina, and
Luca San Mauro
Proc. of the 11th Panhellenic Logic Symposium,
11th Panhellenic Logic Symposium,
vol. , 83-89 (2017)