On the complexity of classifying Lebesgue spaces
Logic
2019-07-01 v1
Abstract
Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.
Cite
@article{arxiv.1906.12209,
title = {On the complexity of classifying Lebesgue spaces},
author = {Tyler Brown and Alexander G. Melnikov and Timothy H. McNicholl},
journal= {arXiv preprint arXiv:1906.12209},
year = {2019}
}