| Publication | Date of Publication | Type |
|---|
Degrees of bi-embeddable categoricity
Computability | 2021-06-25 | Paper |
Learning families of algebraic structures from informant
Information and Computation | 2020-12-15 | 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 |
Degree spectra of structures relative to equivalences
Algebra and Logic | 2019-12-06 | Paper |
Degrees of bi-embeddable categoricity of equivalence structures
Archive for Mathematical Logic | 2019-07-04 | Paper |
Computability-theoretic categoricity and Scott families
Annals of Pure and Applied Logic | 2019-04-30 | Paper |
Computable bi-embeddable categoricity
Algebra and Logic | 2019-03-13 | Paper |
Limit Learning Equivalence Structures
| 2019-02-21 | Paper |
Bi-embeddability spectra and bases of spectra
| 2018-08-16 | Paper |
Linear orders realized by c.e. equivalence relations
Journal of Symbolic Logic | 2016-08-19 | Paper |
Categoricity spectra for rigid structures
Notre Dame Journal of Formal Logic | 2016-03-04 | Paper |
Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
Algebra and Logic | 2016-01-13 | Paper |
Classes of structures with universe a subset of \(\omega _{1}\)
Journal Of Logic And Computation | 2014-04-01 | Paper |
The computable embedding problem
Algebra and Logic | 2012-12-17 | Paper |
Equivalence relations that are \(\Sigma^0_3\) complete for computable reducibility (extended abstract)
Logic, Language, Information and Computation | 2012-09-21 | Paper |
On spectra of computable models
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika | 2012-05-21 | Paper |
Algorithmic properties of models with signatures containing two unary functional symbols
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika | 2012-05-21 | Paper |
Complexity of categorical theories with computable models
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika | 2012-05-11 | Paper |
Isomorphism relations on computable structures
Journal of Symbolic Logic | 2012-04-19 | Paper |
On Σ1 1 equivalence relations over the natural numbers
Mathematical Logic Quarterly | 2012-02-29 | Paper |
Classes of Ulm type and coding rank-homogeneous trees in other structures
Journal of Symbolic Logic | 2011-10-10 | Paper |
The effective theory of Borel equivalence relations
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Equivalence Relations on Classes of Computable Structures
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Degrees of categoricity of computable structures
Archive for Mathematical Logic | 2010-01-22 | Paper |
Intrinsic bounds on complexity and definability at limit levels
Journal of Symbolic Logic | 2009-09-29 | Paper |
Index sets for some classes of structures
Annals of Pure and Applied Logic | 2009-03-25 | Paper |
scientific article; zbMATH DE number 5379427 (Why is no real title available?)
| 2008-12-08 | Paper |
Index sets for classes of high rank structures
Journal of Symbolic Logic | 2008-02-25 | Paper |
Index Sets of Computable Structures with Decidable Theories
Lecture Notes in Computer Science | 2007-11-13 | Paper |
A Lopez-Escobar Theorem for Continuous Domains
| N/A | Paper |
Learning Families of Algebraic Structures from Text
| N/A | Paper |
