On the complexity of classifying lebesgue spaces

Journal of Symbolic Logic 85 (3):1254-1288 (2020)

Abstract

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

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,856

External links

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

Through your library

Analytics

Added to PP
2020-10-27

Downloads
4 (#1,288,493)

6 months
1 (#386,040)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alexander Melnikov
National Research University Higher School of Economics

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

Citations of this work

No citations found.

Add more citations

Similar books and articles

Continuous Logic and Embeddings of Lebesgue Spaces.Timothy H. McNicholl - 2021 - Archive for Mathematical Logic 60 (1-2):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 (45):417-430.
On the Classification of (Effective) Φ-Spaces.YuL Ershov - 2009 - Annals of Pure and Applied Logic 159 (3):285-291.
Spaces Allowing Type-2 Complexity Theory Revisited.Matthias Schröder - 2004 - Mathematical Logic Quarterly 50 (45):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.
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.