On The Complexity Of Classifying Lebesgue Spaces

Tyler Brown,Timothy H. McNicholl,Alexander G. Melnikov

Journal of Symbolic Logic（2020）

引用 13|浏览4

暂无评分

摘要

Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.

查看译文

关键词

computable analysis, computable structure theory, L-p, spaces

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要