A note on the computable categoricity of l^p spaces
classification
🧮 math.LO
keywords
computablerealcasecategoricalcategoricitycomplexcomputablynote
read the original abstract
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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.