| Publication | Date of Publication | Type |
|---|
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 |
On computability-theoretic universality of Boolean-valued models
Journal of Computer and System Sciences | 2026-08-03 | Paper |
Weihrauch degrees of elementary embeddings for prime and saturated models
Lobachevskii Journal of Mathematics | 2026-07-31 | Paper |
Weihrauch complexity for elementary embeddings into countable saturated models
Siberian Mathematical Journal | 2026-07-09 | Paper |
| On a computability-theoretic approach to Boolean-valued models | 2026-07-06 | Paper |
| Comparing the isomorphism types of equivalence structures and preorders | 2026-04-20 | Paper |
| Rogers semilattices in the analytical hierarchy: the case of finite families | 2026-04-20 | Paper |
How to approximate fuzzy sets: mind-changes and the Ershov hierarchy
Synthese | 2026-03-27 | Paper |
On cardinalities of Rogers semilattices for families in the Ershov hierarchy
Information and Computation | 2025-12-15 | Paper |
| On learning existentially definable subsets in a computable structure | 2025-11-19 | Paper |
Undecidability of the degree structure of primitive recursive m-reducibility
Journal of Logic and Computation | 2025-10-29 | Paper |
Classifying different criteria for learning algebraic structures
Annals of Pure and Applied Logic | 2025-10-23 | Paper |
Computably enumerable equivalence relations via primitive recursive reductions
Journal of Logic and Computation | 2025-10-15 | Paper |
A non-computable c.e. closed subset of \([0, 1]\)
Journal of Logic and Computation | 2025-09-30 | Paper |
A Lopez-Escobar theorem for continuous domains
The Journal of Symbolic Logic | 2025-07-24 | Paper |
On weakly coholographic structures
Siberian Mathematical Journal | 2025-06-05 | Paper |
Punctual spectra of algebraic structures and isomorphisms
Algebra and Logic | 2025-06-05 | Paper |
On the theory of computably enumerable linear preorders with concatenation
Siberian Mathematical Journal | 2025-03-26 | Paper |
Degrees of relations on canonically ordered natural numbers and integers
Archive for Mathematical Logic | 2025-02-18 | Paper |
| Learning families of algebraic structures from text | 2025-02-07 | Paper |
| On arithmetical numberings in reverse mathematics | 2025-02-07 | Paper |
| Isomorphism types of Rogers semilattices in the analytical hierarchy | 2025-02-03 | Paper |
| Cantor-Bendixson ranks for almost prime models | 2025-02-03 | Paper |
On learning down-sets in quasi-orders, and ideals in Boolean algebras
Theory of Computing Systems | 2025-01-13 | Paper |
| On learning families of ideals in lattices and Boolean algebras | 2024-11-12 | Paper |
On learning for families of algebraic structures
Lobachevskii Journal of Mathematics | 2024-11-08 | Paper |
Computably and punctually universal spaces
Annals of Pure and Applied Logic | 2024-10-07 | Paper |
| Degree spectra, and relative acceptability of notations | 2024-09-25 | Paper |
Decidable categoricity spectra for almost prime models
Algebra and Logic | 2024-09-04 | Paper |
A note on joins and meets for positive linear preorders
Sibirskie Elektronnye Matematicheskie Izvestiya | 2024-08-14 | Paper |
Every \(\Delta^0_2\) Polish space is computable topological
Proceedings of the American Mathematical Society | 2024-06-13 | Paper |
On diagonal functions for equivalence relations
Archive for Mathematical Logic | 2024-04-16 | Paper |
Computable reducibility for computable linear orders of type
Journal of Mathematical Sciences (New York) | 2024-02-01 | Paper |
On the main scientific achievements of Victor Selivanov
Computability | 2024-01-31 | Paper |
| A note on the degree structure of primitive recursive m-reducibility | 2023-11-26 | Paper |
Primitive recursive reverse mathematics
Annals of Pure and Applied Logic | 2023-10-12 | Paper |
On the effective universality of mereological theories
Mathematical Logic Quarterly | 2023-09-12 | Paper |
Rogers semilattices of limitwise monotonic numberings
Mathematical Logic Quarterly | 2023-09-12 | Paper |
Computable Heyting algebras with distinguished atoms and coatoms
Journal of Logic, Language and Information | 2023-08-16 | Paper |
On two types of concept lattices in the theory of numberings
Lecture Notes in Computer Science | 2023-08-04 | Paper |
Computable Stone spaces
Annals of Pure and Applied Logic | 2023-07-26 | Paper |
Complexity of \(\Sigma^0_n\)-classifications for definable subsets
Archive for Mathematical Logic | 2023-04-27 | Paper |
Learning algebraic structures with the help of Borel equivalence relations
Theoretical Computer Science | 2023-03-10 | Paper |
On universal positive graphs
Siberian Mathematical Journal | 2023-03-02 | Paper |
Computable embeddability for algebraic structures
Asian-European Journal of Mathematics | 2023-02-02 | Paper |
Primitive recursive equivalence relations and their primitive recursive complexity
Computability | 2023-01-12 | Paper |
Minimal generalized computable numberings and families of positive preorders
Algebra and Logic | 2023-01-04 | Paper |
| Semilattices of punctual numberings | 2022-12-22 | Paper |
A note on computable embeddings for ordinals and their reverses
(available as arXiv preprint) | 2022-12-16 | Paper |
| Calculating the mind change complexity of learning algebraic structures | 2022-12-07 | Paper |
| Well-orders realized by C.E. equivalence relations | 2022-12-07 | Paper |
Rogers semilattices of punctual numberings
Mathematical Structures in Computer Science | 2022-11-17 | Paper |
Definable Subsets of Polynomial-Time Algebraic Structures
Computer Science – Theory and Applications | 2022-10-19 | Paper |
Index sets for classes of positive preorders
Algebra and Logic | 2022-08-22 | Paper |
Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy
(available as arXiv preprint) | 2022-06-24 | Paper |
| Relatively acceptable notation | 2022-05-02 | Paper |
On bi-embeddable categoricity of algebraic structures
Annals of Pure and Applied Logic | 2022-01-18 | Paper |
Computable embeddings for pairs of linear orders
Algebra and Logic | 2021-12-01 | Paper |
Punctual categoricity spectra of computably categorical structures
Algebra and Logic | 2021-12-01 | Paper |
On the Turing complexity of learning finite families of algebraic structures
Journal Of Logic And Computation | 2021-11-09 | Paper |
Learning algebraic structures with the help of Borel equivalence relations
(available as arXiv preprint) | 2021-10-27 | Paper |
HKSS-completeness of modal algebras
Sibirskie Elektronnye Matematicheskie Izvestiya | 2021-10-19 | Paper |
| Intrinsic complexity of recursive functions on natural numbers with standard order | 2021-10-04 | Paper |
On categoricity spectra for locally finite graphs
Siberian Mathematical Journal | 2021-09-27 | Paper |
Punctual equivalence relations and their (punctual) complexity
(available as arXiv preprint) | 2021-09-09 | Paper |
Approximating approximate reasoning: Fuzzy sets and the Ershov hierarchy
(available as arXiv preprint) | 2021-07-21 | Paper |
Categoricity spectra of computable structures
Journal of Mathematical Sciences (New York) | 2021-06-29 | Paper |
Degrees of bi-embeddable categoricity
Computability | 2021-06-25 | Paper |
Theories of Rogers semilattices of analytical numberings
Lobachevskii Journal of Mathematics | 2021-06-07 | Paper |
On universal pairs in the Ershov hierarchy
Siberian Mathematical Journal | 2021-02-03 | Paper |
Numberings in the analytical hierarchy
Algebra and Logic | 2021-01-08 | Paper |
Learning families of algebraic structures from informant
Information and Computation | 2020-12-15 | Paper |
The structure of computably enumerable preorder relations
Algebra and Logic | 2020-12-04 | Paper |
Strong degrees of categoricity and weak density
Lobachevskii Journal of Mathematics | 2020-11-11 | Paper |
Minimal equivalence relations in hyperarithmetical and analytical hierarchies
Lobachevskii Journal of Mathematics | 2020-10-27 | Paper |
Online presentations of finitely generated structures
Theoretical Computer Science | 2020-10-21 | Paper |
Classifying equivalence relations in the Ershov hierarchy
Archive for Mathematical Logic | 2020-10-15 | Paper |
| Rogers semilattices in the analytical hierarchy: The case of finite families | 2020-10-02 | Paper |
A note on decidable categoricity and index sets
Sibirskie Elektronnye Matematicheskie Izvestiya | 2020-09-24 | Paper |
| Effective embeddings for pairs of structures | 2020-05-12 | Paper |
| Bounded reducibility for computable numberings | 2020-05-12 | Paper |
Weakly precomplete equivalence relations in the Ershov hierarchy
Algebra and Logic | 2020-02-28 | Paper |
Constructing decidable graphs from decidable structures
Algebra and Logic | 2020-02-28 | Paper |
Decompositions of decidable abelian groups
International Journal of Algebra and Computation | 2020-02-17 | Paper |
| Comparing the isomorphism types of equivalence structures and preorders | 2020-01-22 | Paper |
A Note on Computable Embeddings for Ordinals and Their Reverses
(available as arXiv preprint) | 2020-01-17 | Paper |
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
Journal of Symbolic Logic | 2020-01-10 | Paper |
| Isomorphism types of Rogers semilattices in the analytical hierarchy | 2019-12-11 | Paper |
On decidability of list structures
Siberian Mathematical Journal | 2019-11-01 | Paper |
Computable contact algebras
Fundamenta Informaticae | 2019-10-31 | Paper |
| Computable isomorphisms of distributive lattices | 2019-10-15 | Paper |
FOUNDATIONS OF ONLINE STRUCTURE THEORY
The Bulletin of Symbolic Logic | 2019-08-01 | Paper |
Rogers semilattices for families of equivalence relations in the Ershov hierarchy
Siberian Mathematical Journal | 2019-07-18 | Paper |
Degrees of bi-embeddable categoricity of equivalence structures
Archive for Mathematical Logic | 2019-07-04 | Paper |
Elementary theories and hereditary undecidability for semilattices of numberings
Archive for Mathematical Logic | 2019-03-27 | Paper |
Computable bi-embeddable categoricity
Algebra and Logic | 2019-03-13 | Paper |
Computable embeddings for pairs of linear orders
(available as arXiv preprint) | 2019-01-07 | Paper |
Degrees of autostability for prime Boolean algebras
Algebra and Logic | 2018-11-14 | Paper |
Degrees of autostability relative to strong constructivizations of graphs
Siberian Mathematical Journal | 2018-11-13 | Paper |
