Skip to main content

A Note on the Computable Categoricity of \(\ell ^p\) Spaces

  • Conference paper
  • First Online:
Evolving Computability (CiE 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9136))

Included in the following conference series:

Abstract

Suppose that \(p\) is a computable real and that \(p \ge 1\). We show that in both the real and complex case, \(\ell ^p\) is computably categorical if and only if \(p = 2\). The proof uses Lamperti’s characterization of the isometries of Lebesgue spaces of \(\sigma \)-finite measure spaces.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ash, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol. 144. North-Holland Publishing Co., Amsterdam (2000)

    MATH  Google Scholar 

  2. Banach, S.: Theory of Linear Operations. North-Holland Mathematical Library, vol. 38. North-Holland Publishing Co., Amsterdam (1987). Translated from the French by F. Jellett, With comments by A. Pełczyński and Cz. Bessaga

    Book  MATH  Google Scholar 

  3. Cooper, S.B.: Computability Theory. Chapman & Hall/CRC, Boca Raton (2004)

    MATH  Google Scholar 

  4. Fleming, R.J., Jamison, J.E.: Isometries on Banach Spaces: Function Spaces. Chapman & Hall/CRC Monographs and Surveys in Pure and Applied Mathematics, vol. 129. Chapman & Hall/CRC, Boca Raton (2003)

    Google Scholar 

  5. Goncharov, S.: Autostability and computable families of constructivizations. Algebr. Log. 17, 392–408 (1978). English translation

    Article  MathSciNet  Google Scholar 

  6. Harizanov, V.S.: Pure computable model theory. Handbook of Recursive Mathematics. Volume 1, Studies in Logic and the Foundations of Mathematics, vol. 138, pp. 3–114. North-Holland, Amsterdam (1998)

    Google Scholar 

  7. Lamperti, J.: On the isometries of certain function-spaces. Pac. J. Math. 8, 459–466 (1958)

    Article  MATH  MathSciNet  Google Scholar 

  8. Melnikov, A.G.: Computably isometric spaces. J. Symb. Log. 78(4), 1055–1085 (2013)

    Article  MATH  Google Scholar 

  9. Melnikov, A.G., Ng, K.M.: Computable structures and operations on the space of continuous functions. Available at https://dl.dropboxusercontent.com/u/4752353/ Homepage/C[0,1]_final.pdf

  10. Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1989)

    Book  MATH  Google Scholar 

Download references

Acknowledgement

The author thanks the anonymous referees who made helpful comments. The author’s participation in CiE 2015 was funded by a Simons Foundation Collaboration Grant for Mathematicians.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Timothy H. McNicholl .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

McNicholl, T.H. (2015). A Note on the Computable Categoricity of \(\ell ^p\) Spaces. In: Beckmann, A., Mitrana, V., Soskova, M. (eds) Evolving Computability. CiE 2015. Lecture Notes in Computer Science(), vol 9136. Springer, Cham. https://doi.org/10.1007/978-3-319-20028-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20028-6_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20027-9

  • Online ISBN: 978-3-319-20028-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics