A comparison of various analytic choice principles
Logic
2019-07-08 v1 Logic in Computer Science
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 -closed sets. Among others, we solve an open problem on the Weihrauch degree of the parallelization of the -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.
Keywords
Cite
@article{arxiv.1907.02769,
title = {A comparison of various analytic choice principles},
author = {Paul-Elliot Anglès d'Auriac and Takayuki Kihara},
journal= {arXiv preprint arXiv:1907.02769},
year = {2019}
}