14 citations · 33 across the 9 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.LO2021★ 14 cited
Computable Stone spaces
Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander Melnikov
We investigate computable metrizability of Polish spaces up to homeomorphism. In this paper we focus on Stone spaces. We use Stone duality to construct the first known example of a…
math.LO2021
Computable topological abelian groups
Martino Lupini, Alexander Melnikov, Andre Nies
We study the algorithmic content of Pontryagin - van Kampen duality. We prove that the dualization is computable in the important cases of compact and locally compact totally disco…