On the complexity of classifying lebesgue spaces

, &
Journal of Symbolic Logic 85 (3):1254-1288 (2020)
  Copy   BIBTEX

Abstract

Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2020.63

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic.Mariagnese Giusto & Alberto Marcone - 1998 - Archive for Mathematical Logic 37 (5-6):343-362.
Analytic computable structure theory and $$L^p$$Lp -spaces part 2.Tyler Brown & Timothy H. McNicholl - 2020 - Archive for Mathematical Logic 59 (3-4):427-443.
Continuous logic and embeddings of Lebesgue spaces.Timothy H. McNicholl - 2020 - Archive for Mathematical Logic 60 (1):105-119.
Type-2 computability on spaces of integrables functions.Daren Kunkle - 2004 - Mathematical Logic Quarterly 50 (4):417.
Type‐2 computability on spaces of integrable functions.Daren Kunkle - 2004 - Mathematical Logic Quarterly 50 (4-5):417-430.
Lebesgue’s dominated convergence theorem in Bishop’s style.Claudio Sacerdoti Coen & Enrico Zoli - 2012 - Annals of Pure and Applied Logic 163 (2):140-150.
On the classification of (effective) φ-spaces.YuL Ershov - 2009 - Annals of Pure and Applied Logic 159 (3):285-291.
Computing the complexity of the relation of isometry between separable Banach spaces.Julien Melleray - 2007 - Mathematical Logic Quarterly 53 (2):128-131.
Spaces allowing Type‐2 Complexity Theory revisited.Matthias Schröder - 2004 - Mathematical Logic Quarterly 50 (4-5):443-459.
Polish metric spaces with fixed distance set.Riccardo Camerlo, Alberto Marcone & Luca Motto Ros - 2020 - Annals of Pure and Applied Logic 171 (10):102832.
Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.
Discovering the discovered integral: William Henry Young und das Lebesgue-Integral.Elisabeth Mühlhausen - 1994 - NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin 2 (1):149-158.
How to compute antiderivatives.Chris Freiling - 1995 - Bulletin of Symbolic Logic 1 (3):279-316.
Forcing Complexity: Minimum Sizes of Forcing Conditions.Toshio Suzuki - 2001 - Notre Dame Journal of Formal Logic 42 (2):117-120.
Computational complexity on computable metric spaces.Klaus Weirauch - 2003 - Mathematical Logic Quarterly 49 (1):3-21.

Analytics

Added to PP
2020-10-27

Downloads
10 (#1,165,120)

6 months
5 (#629,136)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references