English

A note on the computable categoricity of l^p spaces

Logic 2015-04-07 v4

Abstract

Suppose pp is a computable real so that p1p \geq 1. We show that in both the real and complex case lpl^p is computably categorical if and only if p2p \neq 2.

Keywords

Cite

@article{arxiv.1412.2288,
  title  = {A note on the computable categoricity of l^p spaces},
  author = {Timothy H. McNicholl},
  journal= {arXiv preprint arXiv:1412.2288},
  year   = {2015}
}