On the complexity of classifying Lebesgue spaces
Authors:
- Tyler BrownTBTyler Brown
- Alexander G. MelnikovAMAlexander G. Melnikov
- Timothy H. McNichollTMTimothy H. McNicholl
Preprint
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 19 references indexed in Scilit:
- COMPUTABLE POLISH GROUP ACTIONSThe Journal of Symbolic Logic, 2018
- Computable topological groups and Pontryagin dualityTransactions of the American Mathematical Society, 2018
- Finding bases of uncountable free abelian groups is usually difficultTransactions of the American Mathematical Society, 2017
- The decomposability problem for torsion-free abelian groups is analytic-completeProceedings of the American Mathematical Society, 2015
- Computable completely decomposable groupsTransactions of the American Mathematical Society, 2014
- Effectively categorical abelian groupsJournal of Algebra, 2013
- Describing free groupsTransactions of the American Mathematical Society, 2012
- The isomorphism problem for torsion-free Abelian groups is analytic completeJournal of Algebra, 2008
- Computable Structure and Non-Structure TheoremsAlgebra and Logic, 2002
- Index sets in computable analysisTheoretical Computer Science, 1999