A note on the computable categoricity of l^p spaces

preprint2015arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.