| Publication | Date of Publication | Type |
|---|
Scott sentence complexities of linear orderings
The Journal of Symbolic Logic | 2026-02-12 | Paper |
Hausdorff dimension and countable Borel equivalence relations
Proceedings of the American Mathematical Society | 2026-01-20 | Paper |
Feferman's completeness theorem
The Bulletin of Symbolic Logic | 2025-11-18 | Paper |
Relations enumerable from positive information
Journal of Logic and Computation | 2025-10-15 | Paper |
The Borel complexity of the class of models of first-order theories
Proceedings of the American Mathematical Society | 2025-07-27 | Paper |
A Lopez-Escobar theorem for continuous domains
The Journal of Symbolic Logic | 2025-07-24 | Paper |
| Learning families of algebraic structures from text | 2025-02-07 | Paper |
| Algorithmic aspects of left-orderings of solvable Baumslag-Solitar groups via its dynamical realization | 2025-02-07 | Paper |
The structural complexity of models of arithmetic
The Journal of Symbolic Logic | 2025-02-03 | Paper |
Degrees of categoricity and treeable degrees
Journal of Mathematical Logic | 2024-12-06 | Paper |
| Scott sentence complexities of linear orderings | 2023-05-11 | Paper |
DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS
Journal of Symbolic Logic | 2022-11-18 | Paper |
| Degrees of categoricity and treeable degrees | 2022-09-09 | Paper |
| The structural complexity of models of arithmetic | 2022-08-02 | Paper |
| Relations enumerable from positive information | 2022-06-02 | Paper |
Positive enumerable functors
(available as arXiv preprint) | 2022-03-22 | Paper |
On bi-embeddable categoricity of algebraic structures
Annals of Pure and Applied Logic | 2022-01-18 | Paper |
Degrees of bi-embeddable categoricity
Computability | 2021-06-25 | Paper |
THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
Journal of Symbolic Logic | 2021-03-19 | Paper |
Positive enumerable functors
(available as arXiv preprint) | 2020-11-28 | Paper |
Degree spectra of analytic complete equivalence relations
(available as arXiv preprint) | 2020-10-01 | Paper |
Bi‐embeddability spectra and bases of spectra
Mathematical Logic Quarterly | 2020-05-06 | Paper |
Measuring the complexity of reductions between equivalence relations
Computability | 2020-01-17 | Paper |
Degrees of bi-embeddable categoricity of equivalence structures
Archive for Mathematical Logic | 2019-07-04 | Paper |
Computable bi-embeddable categoricity
Algebra and Logic | 2019-03-13 | Paper |
| Elementary bi-embeddability spectra of structures | 2018-09-06 | Paper |
Bi-embeddability spectra and bases of spectra
(available as arXiv preprint) | 2018-08-16 | Paper |
On functors enumerating structures
Sibirskie Elektronnye Matematicheskie Izvestiya | 2017-09-11 | Paper |
A Lopez-Escobar Theorem for Continuous Domains
(available as arXiv preprint) | N/A | Paper |
Learning Families of Algebraic Structures from Text
(available as arXiv preprint) | N/A | Paper |
The Borel complexity of the class of models of first-order theories
(available as arXiv preprint) | N/A | Paper |
Learning Equivalence Relations on Polish Spaces
(available as arXiv preprint) | N/A | Paper |
