2019/07/05 by d'Auriac, Paul-Elliot Anglès, Kihara, Takayuki
#FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)
paper · doi:10.48550/arxiv.1907.02769
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 Σ11-closed sets. Among others, we solve an open problem on the Weihrauch degree of the parallelization of the Σ11-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.