| Publication | Date of Publication | Type |
|---|
| On diagonal functions for equivalence relations | 2024-04-16 | Paper |
| Computable reducibility for computable linear orders of type \(\omega \) | 2024-02-01 | Paper |
| On the main scientific achievements of Victor Selivanov | 2024-01-31 | Paper |
| A note on the degree structure of primitive recursive m-reducibility | 2023-11-26 | Paper |
| Primitive recursive reverse mathematics | 2023-10-12 | Paper |
| On the effective universality of mereological theories | 2023-09-12 | Paper |
| Rogers semilattices of limitwise monotonic numberings | 2023-09-12 | Paper |
| Computable Heyting algebras with distinguished atoms and coatoms | 2023-08-16 | Paper |
| On two types of concept lattices in the theory of numberings | 2023-08-04 | Paper |
| Computable Stone spaces | 2023-07-26 | Paper |
| Complexity of \(\Sigma^0_n\)-classifications for definable subsets | 2023-04-27 | Paper |
| Learning algebraic structures with the help of Borel equivalence relations | 2023-03-10 | Paper |
| On universal positive graphs | 2023-03-02 | Paper |
| Computable embeddability for algebraic structures | 2023-02-02 | Paper |
| Primitive recursive equivalence relations and their primitive recursive complexity | 2023-01-12 | Paper |
| Minimal generalized computable numberings and families of positive preorders | 2023-01-04 | Paper |
| Semilattices of punctual numberings | 2022-12-22 | Paper |
| A note on computable embeddings for ordinals and their reverses | 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 | 2022-11-17 | Paper |
| Definable Subsets of Polynomial-Time Algebraic Structures | 2022-10-19 | Paper |
| Index sets for classes of positive preorders | 2022-08-22 | Paper |
| Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy | 2022-06-24 | Paper |
| Relatively acceptable notation | 2022-05-02 | Paper |
| On bi-embeddable categoricity of algebraic structures | 2022-01-18 | Paper |
| Computable embeddings for pairs of linear orders | 2021-12-01 | Paper |
| Punctual categoricity spectra of computably categorical structures | 2021-12-01 | Paper |
| On the Turing complexity of learning finite families of algebraic structures | 2021-11-09 | Paper |
| Learning algebraic structures with the help of Borel equivalence relations | 2021-10-27 | Paper |
| HKSS-completeness of modal algebras | 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 | 2021-09-27 | Paper |
| Punctual equivalence relations and their (punctual) complexity | 2021-09-09 | Paper |
| Approximating approximate reasoning: Fuzzy sets and the Ershov hierarchy | 2021-07-21 | Paper |
| Categoricity spectra of computable structures | 2021-06-29 | Paper |
| Degrees of bi-embeddable categoricity | 2021-06-25 | Paper |
| Theories of Rogers semilattices of analytical numberings | 2021-06-07 | Paper |
| On universal pairs in the Ershov hierarchy | 2021-02-03 | Paper |
| Numberings in the analytical hierarchy | 2021-01-08 | Paper |
| Learning families of algebraic structures from informant | 2020-12-15 | Paper |
| The structure of computably enumerable preorder relations | 2020-12-04 | Paper |
| Strong degrees of categoricity and weak density | 2020-11-11 | Paper |
| Minimal equivalence relations in hyperarithmetical and analytical hierarchies | 2020-10-27 | Paper |
| Online presentations of finitely generated structures | 2020-10-21 | Paper |
| Classifying equivalence relations in the Ershov hierarchy | 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 | 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 | 2020-02-28 | Paper |
| Constructing decidable graphs from decidable structures | 2020-02-28 | Paper |
| Decompositions of decidable abelian groups | 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 | 2020-01-17 | Paper |
| AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES | 2020-01-10 | Paper |
| Isomorphism types of Rogers semilattices in the analytical hierarchy | 2019-12-11 | Paper |
| On decidability of list structures | 2019-11-01 | Paper |
| Computable Contact Algebras | 2019-10-31 | Paper |
| Computable isomorphisms of distributive lattices | 2019-10-15 | Paper |
| FOUNDATIONS OF ONLINE STRUCTURE THEORY | 2019-08-01 | Paper |
| Rogers semilattices for families of equivalence relations in the Ershov hierarchy | 2019-07-18 | Paper |
| Degrees of bi-embeddable categoricity of equivalence structures | 2019-07-04 | Paper |
| Elementary theories and hereditary undecidability for semilattices of numberings | 2019-03-27 | Paper |
| Computable bi-embeddable categoricity | 2019-03-13 | Paper |
| Computable embeddings for pairs of linear orders | 2019-01-07 | Paper |
| Degrees of autostability for prime Boolean algebras | 2018-11-14 | Paper |
| Degrees of autostability relative to strong constructivizations of graphs | 2018-11-13 | Paper |
| Degrees of categoricity for prime and homogeneous models | 2018-09-06 | Paper |
| On dark computably enumerable equivalence relations | 2018-06-20 | Paper |
| DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION | 2018-05-02 | Paper |
| Effective categoricity for distributive lattices and Heyting algebras | 2017-09-20 | Paper |
| Boolean algebras realized by c.e. equivalence relations | 2017-09-11 | Paper |
| Turing computable embeddings, computable infinitary equivalence, and linear orders | 2017-08-04 | Paper |
| Degrees of categoricity of rigid structures | 2017-08-04 | Paper |
| Degrees of autostability relative to strong constructivizations for Boolean algebras | 2017-07-18 | Paper |
| Degrees of categoricity vs. strong degrees of categoricity | 2017-07-18 | Paper |
| Degrees of autostability for linear orders and linearly ordered abelian groups | 2017-07-18 | Paper |
| The index set of the groups autostable relative to strong constructivizations | 2017-06-30 | Paper |
| A Note on Effective Categoricity for Linear Orderings | 2017-05-19 | Paper |
| Categoricity spectra for polymodal algebras | 2017-03-02 | Paper |
| Automatic structures and the theory of lists | 2016-07-28 | Paper |
| 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms | 2016-07-22 | Paper |
| Boolean Algebras with Distinguished Endomorphisms and Generating Trees | 2016-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5741407 | 2016-07-22 | Paper |
| Index sets of autostable relative to strong constructivizations constructive models for familiar classes | 2016-01-29 | Paper |
| Computable numberings of the class of Boolean algebras with distinguished endomorphisms | 2015-11-13 | Paper |
| The branching theorem and computable categoricity in the Ershov hierarchy | 2015-10-27 | Paper |
| Prime Model with No Degree of Autostability Relative to Strong Constructivizations | 2015-10-20 | Paper |
| The index set of Boolean algebras autostable relative to strong constructivizations | 2015-09-28 | Paper |
| Autostability spectra for Boolean algebras | 2015-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5398234 | 2014-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5398260 | 2014-02-26 | Paper |
| Degrees of categoricity for superatomic Boolean algebras | 2014-02-06 | Paper |
| Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism | 2013-11-27 | Paper |
| Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism | 2013-02-21 | Paper |
