Timothy H. McNicholl

collaborators

3 papers

math.LO2024

Evaluative presentations

Timothy H. McNicholl

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 presen…

math.LO2014

A note on the computable categoricity of l^p spaces

Timothy H. McNicholl

Suppose $p$ is a computable real so that $p \geq 1$ . We show that in both the real and complex case $l^{p}$ is computably categorical if and only if $p \neq = 2$ .

math.CV2014

Carathéodory's Theorem and moduli of local connectivity

Timothy H. McNicholl

We give a constructive proof of the Carathéodory Theorem by means of the concept of a modulus of local connectivity and the extremal distance of the separating curves of an annulus…