Cardinal invariants, non-lowness classes, and Weihrauch reducibility

被引:5
|
作者
Greenberg, Noam [1 ]
Kuyper, Rutger [1 ]
Turetsky, Dan [1 ]
机构
[1] Victoria Univ Wellington, Dept Math, Wellington, New Zealand
来源
关键词
Cardinal invariants; Weihrauch reducibility; Turing degrees; RANDOMNESS;
D O I
10.3233/COM-180219
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We provide a survey of results using Weihrauch problems to find analogs between set theory and computability theory. In our treatment, we emphasize the role of morphisms in explaining these coincidences. We end with a discussion of the use of forcing to prove the nonexistence of morphisms.
引用
收藏
页码:305 / 346
页数:42
相关论文
共 3 条