ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES

被引:5
|
作者
Brown, Tyler A. [1 ,2 ]
Mcnicholl, Timothy H. [1 ]
Melnikov, Alexander G. [3 ]
机构
[1] Iowa State Univ, Dept Math, Ames, IA 50011 USA
[2] Columbia Coll, Div Hlth Math & Sci, Columbia, SC 29203 USA
[3] Inst Nat & Math Sci, Private Bag 102 904 NSMC, Auckland 0745, New Zealand
关键词
computable analysis; computable structure theory; L-p; spaces; FREE ABELIAN-GROUPS;
D O I
10.1017/jsl.2020.63
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.
引用
收藏
页码:1254 / 1288
页数:35
相关论文
共 50 条