Computable topological abelian groups

Abstract

We study the algorithmic content of Pontryagin - van Kampen duality. We prove that the process of dualization is computable in the important cases of compact and locally compact totally disconnected Polish abelian groups. The applications of our main results include solutions to questions of Kihara and Ng about presentations of connected Polish spaces, and an unexpected arithmetical characterisation of direct products of solenoid groups among all Polish groups.