Evaluative presentations
arXiv:2403.13616
Abstract
We study presentations of that are evaluative over a presentation of in that is computable. We prove existence-uniqueness theorems for such presentations. We use our methods to prove an effective Banach-Stone Theorem for unital commutative algebras. We also apply our results to the computable categoricity of algebras and compact Polish spaces.