Analytic computable structure theory and LpL^pLp -spaces part 2

&
Archive for Mathematical Logic 59 (3-4):427-443 (2020)
  Copy   BIBTEX

Abstract

Suppose \ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by determining the degrees of categoricity of the separable \ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we ascertain the complexity of associated projection maps.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-019-00697-4

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,748

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Degrees of categoricity of computable structures.Ekaterina B. Fokina, Iskander Kalimullin & Russell Miller - 2010 - Archive for Mathematical Logic 49 (1):51-67.
Type‐2 computability on spaces of integrable functions.Daren Kunkle - 2004 - Mathematical Logic Quarterly 50 (4):417-430.
Uniform domain representations of "Lp" -spaces.Petter K. Køber - 2007 - Mathematical Logic Quarterly 53 (2):180-205.
Computability of measurable sets via effective topologies.Yongcheng Wu & Decheng Ding - 2006 - Archive for Mathematical Logic 45 (3):365-379.
Degrees of bi-embeddable categoricity of equivalence structures.Nikolay Bazhenov, Ekaterina Fokina, Dino Rossegger & Luca San Mauro - 2019 - Archive for Mathematical Logic 58 (5-6):543-563.
Degrees of Categoricity and the Hyperarithmetic Hierarchy.Barbara F. Csima, Johanna N. Y. Franklin & Richard A. Shore - 2013 - Notre Dame Journal of Formal Logic 54 (2):215-231.
Degrees of categoricity and treeable degrees.Barbara F. Csima & Dino Rossegger - 2023 - Journal of Mathematical Logic 24 (3).
On the complexity of categoricity in computable structures.Walker M. White - 2003 - Mathematical Logic Quarterly 49 (6):603.
Turing degrees in Polish spaces and decomposability of Borel functions.Vassilios Gregoriades, Takayuki Kihara & Keng Meng Ng - 2020 - Journal of Mathematical Logic 21 (1):2050021.
Computability Theory on Polish Metric Spaces.Teerawat Thewmorakot - 2023 - Bulletin of Symbolic Logic 29 (4):664-664.

Analytics

Added to PP
2019-11-01

Downloads
17 (#1,227,964)

6 months
4 (#970,122)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable Presentations of C*-Algebras.F. O. X. Alec - 2024 - Journal of Symbolic Logic 89 (3):1313-1338.

Add more citations

References found in this work

Degrees That Are Not Degrees of Categoricity.Bernard Anderson & Barbara Csima - 2016 - Notre Dame Journal of Formal Logic 57 (3):389-398.
Computably Isometric Spaces.Alexander G. Melnikov - 2013 - Journal of Symbolic Logic 78 (4):1055-1085.

Add more references