Alexander Melnikov

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Computably and punctually universal spaces
Annals of Pure and Applied Logic
2024-10-07Paper
An arithmetic analysis of closed surfaces
Transactions of the American Mathematical Society
2024-07-04Paper
Every \(\Delta^0_2\) Polish space is computable topological
Proceedings of the American Mathematical Society
2024-06-13Paper
Separating notions in effective topology
International Journal of Algebra and Computation
2024-01-04Paper
Primitive recursive reverse mathematics
Annals of Pure and Applied Logic
2023-10-12Paper
COMPUTABLY COMPACT METRIC SPACES
The Bulletin of Symbolic Logic
2023-08-10Paper
Computable Stone spaces
Annals of Pure and Applied Logic
2023-07-26Paper
Computable analysis and classification problems
 
2022-12-16Paper
Computable topological abelian groups
Journal of Algebra
2022-11-23Paper
Computable topological groups
 
2022-09-10Paper
Random Subgroups of Rationals
 
2022-07-21Paper
Computably totally disconnected locally compact groups
 
2022-04-21Paper
scientific article; zbMATH DE number 7407778 (Why is no real title available?)
 
2021-10-08Paper
Relativizing computable categoricity
Proceedings of the American Mathematical Society
2021-07-28Paper
Non-density in punctual computability
Annals of Pure and Applied Logic
2021-07-26Paper
Punctual definability on structures
Annals of Pure and Applied Logic
2021-06-14Paper
Punctual categoricity relative to a computable oracle
Lobachevskii Journal of Mathematics
2021-06-07Paper
Computable topological abelian groups
 
2021-05-26Paper
Computability of Polish spaces up to homeomorphism
Journal of Symbolic Logic
2021-04-15Paper
PUNCTUAL CATEGORICITY AND UNIVERSALITY
Journal of Symbolic Logic
2021-04-15Paper
ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
Journal of Symbolic Logic
2021-03-19Paper
Online presentations of finitely generated structures
Theoretical Computer Science
2020-10-21Paper
Computable classifications of continuous, transducer, and regular functions
 
2020-10-19Paper
Enumerating abelian \(p\)-groups
Journal of Algebra
2020-08-25Paper
Foundations of Online Structure Theory II: The Operator Approach
 
2020-07-14Paper
Graphs are not universal for online computability
Journal of Computer and System Sciences
2020-06-09Paper
Turing reducibility in the fine hierarchy
Annals of Pure and Applied Logic
2020-06-02Paper
A structure of punctual dimension two
Proceedings of the American Mathematical Society
2020-05-27Paper
On realization of index sets in \(\Pi_1^0\)-classes
Algebra and Logic
2020-02-28Paper
Decompositions of decidable abelian groups
International Journal of Algebra and Computation
2020-02-17Paper
The back-and-forth method and computability without delay
Israel Journal of Mathematics
2019-12-17Paper
FOUNDATIONS OF ONLINE STRUCTURE THEORY
The Bulletin of Symbolic Logic
2019-08-01Paper
Categorical linearly ordered structures
Annals of Pure and Applied Logic
2019-07-10Paper
Effectively closed subgroups of the infinite symmetric group
Proceedings of the American Mathematical Society
2018-10-23Paper
Computable topological groups and Pontryagin duality
Transactions of the American Mathematical Society
2018-10-18Paper
Computable Polish group actions
Journal of Symbolic Logic
2018-08-10Paper
Uniform procedures in uncountable structures
Journal of Symbolic Logic
2018-08-10Paper
Torsion-free abelian groups with optimal Scott families
Journal of Mathematical Logic
2018-06-13Paper
On a question of Kalimullin
Proceedings of the American Mathematical Society
2018-06-04Paper
Computable torsion abelian groups
Advances in Mathematics
2018-01-11Paper
The diversity of categoricity without delay
Algebra and Logic
2018-01-05Paper
On computable field embeddings and difference closed fields
Canadian Journal of Mathematics
2017-12-13Paper
A Friedberg enumeration of equivalence structures
Journal of Mathematical Logic
2017-12-04Paper
New degree spectra of abelian groups
Notre Dame Journal of Formal Logic
2017-11-06Paper
Eliminating unbounded search in computable algebra
 
2017-08-04Paper
Computable functors and effective interpretability
Journal of Symbolic Logic
2017-06-01Paper
Algebraic structures computable without delay
Theoretical Computer Science
2017-05-12Paper
Proper divisibility in computable rings
Journal of Algebra
2017-01-16Paper
Abelian \(p\)-groups and the halting problem
Annals of Pure and Applied Logic
2016-08-31Paper
Comparing classes of finite sums
Algebra and Logic
2016-05-12Paper
Computable structures and operations on the space of continuous functions
Fundamenta Mathematicae
2016-04-28Paper
Computable abelian groups
The Bulletin of Symbolic Logic
2016-03-18Paper
Independence in computable algebra
Journal of Algebra
2015-09-25Paper
On \(\Delta_2^0\)-categoricity of equivalence relations
Annals of Pure and Applied Logic
2015-05-26Paper
Iterated effective embeddings of abelian \(p\)-groups
International Journal of Algebra and Computation
2015-01-21Paper
Computable completely decomposable groups
Transactions of the American Mathematical Society
2014-09-17Paper
Computably Isometric Spaces
Journal of Symbolic Logic
2014-04-04Paper
Limitwise monotonic sequences and degree spectra of structures
Proceedings of the American Mathematical Society
2013-08-30Paper
The classification problem for compact computable metric spaces
Lecture Notes in Computer Science
2013-08-05Paper
\(K\)-triviality in computable metric spaces
Proceedings of the American Mathematical Society
2013-07-05Paper
Effectively categorical abelian groups
Journal of Algebra
2013-07-02Paper
Jump degrees of torsion-free abelian groups
Journal of Symbolic Logic
2013-01-07Paper
Transforming trees into abelian groups
 
2012-04-23Paper
Classes of Ulm type and coding rank-homogeneous trees in other structures
Journal of Symbolic Logic
2011-10-10Paper
Computable ordered abelian groups and fields
Programs, Proofs, Processes
2010-07-29Paper
\(\mathbf 0\)-categorical completely decomposable torsion-free abelian groups
Mathematical Theory and Computational Practice
2010-07-28Paper
Decidability and computability of certain torsion-free abelian groups
Notre Dame Journal of Formal Logic
2010-06-11Paper
Enumerations and completely decomposable torsion-free abelian groups
Theory of Computing Systems
2009-10-19Paper
Enumerations and Torsion Free Abelian Groups
Lecture Notes in Computer Science
2007-11-13Paper
Computable Gelfand Duality
 
N/APaper


Research outcomes over time


This page was built for person: Alexander Melnikov