Author:
D’AURIAC PAUL-ELLIOT ANGLÈS,KIHARA TAKAYUKI
Abstract
AbstractWe investigate computability theoretic and descriptive set theoretic contents of various kinds of analytic choice principles by performing a 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 this problem.
Publisher
Cambridge University Press (CUP)
Reference22 articles.
1. Higher Recursion Theory
2. Weihrauch Complexity in Computable Analysis
3. Density of the Medvedev lattice of ?01 classes
4. On the algebraic structure of Weihrauch degrees;Brattka;Logical Methods in Computer Science,2018
5. Descending sequences of degrees;Steel;this Journal,1975
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献