Evaluative presentations
Abstract We study presentations of $C(X)$ that are evaluative over a presentation of $X$ in that $(f,p) \mapsto f(p)$ is computable. We prove existence–uniqueness theorems for such presentations. We use our methods to prove an effective Banach–Stone Theorem for unital commutative $C^{*}$ algebras. We also apply our results to the computable categoricity of $C^{*}$ algebras and compact Polish spaces.
Authors
- Timothy H. McNicholl (ORCID: https://orcid.org/0000-0001-8334-4367)
Institutions
- Iowa State University (US)
Publication Details
- Journal
- Journal of Logic and Computation
- Published
- 2025-06-11
- DOI
- https://doi.org/10.1093/logcom/exaf036
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00