8 citations · 29 across the 22 of their papers we have counts for
22 papers · 1 filter
The computable functional calculus
Christopher J. Eagle, Timothy H. McNicholl
We show that the continuous functional calculus is computable. As consequences we obtain the computable compactness of the spectrum of any computable normal element of a computably…
Computable -theory for -algebras: UHF algebras
Christopher Eagle, Isaac Goldbring, Timothy McNicholl +1
We initiate the study of the effective content of -theory for -algebras. We prove that there are computable functors which associate, to a computably enumerable pr…
Evaluative presentations
Timothy H. McNicholl
We study presentations of that are evaluative over a presentation of in that is computable. We prove existence-uniqueness theorems for such presen…
Computable Gelfand Duality
Peter Burton, Christopher J. Eagle, Alec Fox +5
We establish a computable version of Gelfand Duality. Under this computable duality, computably compact presentations of metrizable spaces uniformly effectively correspond to compu…
Hyperarithmetic numerals
Caleb M. H. Camrud, Timothy H. McNicholl
Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language th…
On the complexity of the theory of a computably presented metric structure
Caleb Camrud, Isaac Goldbring, Timothy H. McNicholl
We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value o…