- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
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.Other Versions
No versions found
My notes
Similar books and articles
Type‐2 computability on spaces of integrable functions.Daren Kunkle - 2004 - Mathematical Logic Quarterly 50 (4):417-430.
Complexity of Index Sets of Descriptive Set-Theoretic Notions.Reese Johnston & Dilip Raghavan - 2022 - Journal of Symbolic Logic 87 (3):894-911.
Computability Theory on Polish Metric Spaces.Teerawat Thewmorakot - 2023 - Bulletin of Symbolic Logic 29 (4):664-664.
Classifying the computational complexity of problems.Larry Stockmeyer - 1987 - Journal of Symbolic Logic 52 (1):1-43.
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.
Spaces allowing Type‐2 Complexity Theory revisited.Matthias Schröder - 2004 - Mathematical Logic Quarterly 50 (4-5):443-459.
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.
Algorithmic randomness and measures of complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Computably Isometric Spaces.Alexander G. Melnikov - 2013 - Journal of Symbolic Logic 78 (4):1055-1085.
Analytics
Added to PP
2020-10-27
Downloads
24 (#1,016,106)
6 months
6 (#745,008)
2020-10-27
Downloads
24 (#1,016,106)
6 months
6 (#745,008)
Historical graph of 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.
Computable Presentations of C*-Algebras.F. O. X. Alec - 2024 - Journal of Symbolic Logic 89 (3):1313-1338.
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.
A Friedberg enumeration of equivalence structures.Rodney G. Downey, Alexander G. Melnikov & Keng Meng Ng - 2017 - Journal of Mathematical Logic 17 (2):1750008.
Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets.Robert I. Soare - 1990 - Journal of Symbolic Logic 55 (1):356-357.
Countable Boolean Algebras and Decidability.Sergei S. Goncharov - 1999 - Studia Logica 63 (3):443-445.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-5b9ff6f457-db4gm uwo