A comparison of various analytic choice principles

Abstract

We investigate computability theoretic and descriptive set theoretic contents of various kinds of analytic choice principles by performing detailed analysis of the Medvedev lattice of ${\Sigma }_1^1$-closed sets. Among others, we solve an open problem on the Weihrauch degree of the parallelization of the ${\Sigma }_1^1$-choice principle on the integers. Harrington's unpublished result on a jump hierarchy along a pseudo-well-ordering plays a key role in solving the problem.

Cited by in corpus (1)

• An update on Weihrauch complexity, and some open questions