Skip to main content
Top

2015 | OriginalPaper | Chapter

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

Author : Timothy H. McNicholl

Published in: Evolving Computability

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference 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 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
2.
go back to reference 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. BessagaMATHCrossRef 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. BessagaMATHCrossRef
3.
go back to reference Cooper, S.B.: Computability Theory. Chapman & Hall/CRC, Boca Raton (2004)MATH Cooper, S.B.: Computability Theory. Chapman & Hall/CRC, Boca Raton (2004)MATH
4.
go back to reference 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) 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)
5.
go back to reference Goncharov, S.: Autostability and computable families of constructivizations. Algebr. Log. 17, 392–408 (1978). English translationMathSciNetCrossRef Goncharov, S.: Autostability and computable families of constructivizations. Algebr. Log. 17, 392–408 (1978). English translationMathSciNetCrossRef
6.
go back to reference 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) 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)
8.
10.
go back to reference Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1989)MATHCrossRef Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1989)MATHCrossRef
Metadata
Title
A Note on the Computable Categoricity of Spaces
Author
Timothy H. McNicholl
Copyright Year
2015
DOI
https://doi.org/10.1007/978-3-319-20028-6_27

Premium Partner