Computable Gelfand Duality
Logic
2024-03-21 v2 Functional Analysis
Abstract
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to computable presentations of unital commutative algebras.
Keywords
Cite
@article{arxiv.2402.16672,
title = {Computable Gelfand Duality},
author = {Peter Burton and Christopher J. Eagle and Alec Fox and Isaac Goldbring and Matthew Harrison-Trainor and Timothy H. McNicholl and Alexander Melnikov and Teerawat Thewmorakot},
journal= {arXiv preprint arXiv:2402.16672},
year = {2024}
}