ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
/ Authors
/ Abstract
Abstract Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.
Journal: The Journal of Symbolic Logic
DOI: 10.1017/jsl.2020.63