ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- 1 June 2020
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 85 (3) , 1254-1288
Abstract
Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Effectively categorical abelian groupsJournal of Algebra, 2013
- Describing free groups, Part II: Π⁰₄ hardness and no Σ₂⁰ basisTransactions of the American Mathematical Society, 2012
- Describing free groupsTransactions of the American Mathematical Society, 2012
- The isomorphism problem for torsion-free Abelian groups is analytic completeJournal of Algebra, 2008
- Index sets in computable analysisTheoretical Computer Science, 1999
- On a hierarchy of sets. IIIAlgebra and Logic, 1970
- On a hierarchy of sets, IIAlgebra and Logic, 1968
- On the isometries of certain function-spacesPacific Journal of Mathematics, 1958
- On the uniform convexity of Lp and lpArkiv för Matematik, 1956
- Concrete Representation of Abstract (L)-Spaces and the Mean Ergodic TheoremAnnals of Mathematics, 1941