Cardinal invariants, non-lowness classes, and Weihrauch reducibility
Noam Greenberg, Rutger Kuyper, Dan Turetsky · Computability · 2019
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.