Alexander Melnikov

From MaRDI portal
Person:306576

Available identifiers

zbMath Open melnikov.alexander-gWikidataQ96484283 ScholiaQ96484283MaRDI QIDQ306576

List of research outcomes





PublicationDate of PublicationType
Computably and punctually universal spaces2024-10-07Paper
An arithmetic analysis of closed surfaces2024-07-04Paper
Every \(\Delta^0_2\) Polish space is computable topological2024-06-13Paper
Separating notions in effective topology2024-01-04Paper
Primitive recursive reverse mathematics2023-10-12Paper
COMPUTABLY COMPACT METRIC SPACES2023-08-10Paper
Computable Stone spaces2023-07-26Paper
Computable analysis and classification problems2022-12-16Paper
Computable topological abelian groups2022-11-23Paper
Computable topological groups2022-09-10Paper
Random Subgroups of Rationals2022-07-21Paper
Computably totally disconnected locally compact groups2022-04-21Paper
https://portal.mardi4nfdi.de/entity/Q51556672021-10-08Paper
Relativizing computable categoricity2021-07-28Paper
Non-density in punctual computability2021-07-26Paper
Punctual definability on structures2021-06-14Paper
Punctual categoricity relative to a computable oracle2021-06-07Paper
Computable topological abelian groups2021-05-26Paper
COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM2021-04-15Paper
PUNCTUAL CATEGORICITY AND UNIVERSALITY2021-04-15Paper
ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES2021-03-19Paper
Online presentations of finitely generated structures2020-10-21Paper
Computable classifications of continuous, transducer, and regular functions2020-10-19Paper
Enumerating abelian \(p\)-groups2020-08-25Paper
Foundations of Online Structure Theory II: The Operator Approach2020-07-14Paper
Graphs are not universal for online computability2020-06-09Paper
Turing reducibility in the fine hierarchy2020-06-02Paper
A structure of punctual dimension two2020-05-27Paper
On realization of index sets in \(\Pi_1^0\)-classes2020-02-28Paper
Decompositions of decidable abelian groups2020-02-17Paper
The back-and-forth method and computability without delay2019-12-17Paper
FOUNDATIONS OF ONLINE STRUCTURE THEORY2019-08-01Paper
Categorical linearly ordered structures2019-07-10Paper
Effectively closed subgroups of the infinite symmetric group2018-10-23Paper
Computable topological groups and Pontryagin duality2018-10-18Paper
COMPUTABLE POLISH GROUP ACTIONS2018-08-10Paper
UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES2018-08-10Paper
Torsion-free abelian groups with optimal Scott families2018-06-13Paper
On a question of Kalimullin2018-06-04Paper
Computable torsion abelian groups2018-01-11Paper
The diversity of categoricity without delay2018-01-05Paper
On Computable Field Embeddings and Difference Closed Fields2017-12-13Paper
A Friedberg enumeration of equivalence structures2017-12-04Paper
New degree spectra of abelian groups2017-11-06Paper
Eliminating unbounded search in computable algebra2017-08-04Paper
COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY2017-06-01Paper
Algebraic structures computable without delay2017-05-12Paper
Proper divisibility in computable rings2017-01-16Paper
Abelian \(p\)-groups and the halting problem2016-08-31Paper
Comparing classes of finite sums2016-05-12Paper
Computable structures and operations on the space of continuous functions2016-04-28Paper
Computable abelian groups2016-03-18Paper
Independence in computable algebra2015-09-25Paper
On \(\Delta_2^0\)-categoricity of equivalence relations2015-05-26Paper
Iterated effective embeddings of abelian p-groups2015-01-21Paper
Computable completely decomposable groups2014-09-17Paper
Computably Isometric Spaces2014-04-04Paper
Limitwise monotonic sequences and degree spectra of structures2013-08-30Paper
The Classification Problem for Compact Computable Metric Spaces2013-08-05Paper
\(K\)-triviality in computable metric spaces2013-07-05Paper
Effectively categorical abelian groups2013-07-02Paper
Jump degrees of torsion-free abelian groups2013-01-07Paper
https://portal.mardi4nfdi.de/entity/Q53896242012-04-23Paper
Classes of Ulm type and coding rank-homogeneous trees in other structures2011-10-10Paper
Computable Ordered Abelian Groups and Fields2010-07-29Paper
0″-Categorical Completely Decomposable Torsion-Free Abelian Groups2010-07-28Paper
Decidability and computability of certain torsion-free abelian groups2010-06-11Paper
Enumerations and completely decomposable torsion-free abelian groups2009-10-19Paper
Enumerations and Torsion Free Abelian Groups2007-11-13Paper
Computable Gelfand DualityN/APaper

Research outcomes over time

This page was built for person: Alexander Melnikov