当前位置:
X-MOL 学术
›
J. Symb. Log.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
The Journal of Symbolic Logic ( IF 0.5 ) Pub Date : 2020-10-26 , DOI: 10.1017/jsl.2020.63 TYLER A. BROWN , TIMOTHY H. MCNICHOLL , ALEXANDER G. MELNIKOV
The Journal of Symbolic Logic ( IF 0.5 ) Pub Date : 2020-10-26 , DOI: 10.1017/jsl.2020.63 TYLER A. BROWN , TIMOTHY H. MCNICHOLL , ALEXANDER G. MELNIKOV
Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.
中文翻译:
关于分类 LEBESGUE 空间的复杂性
可计算性理论用于评估分类各种 Lebesgue 空间和相关等距同构问题的复杂性。
更新日期:2020-10-26
中文翻译:
关于分类 LEBESGUE 空间的复杂性
可计算性理论用于评估分类各种 Lebesgue 空间和相关等距同构问题的复杂性。