8 citations · 29 across the 22 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.LO2024
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…
math.LO2024
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…