A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES

DOI10.1017/jsl.2021.37OpenAlexW3166861433MaRDI QIDQ5021923

Paul-Elliot Anglès d'Auriac, Takayuki Kihara

Publication date: 17 January 2022

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.02769

zbMATH Keywords

weihrauch reducibility\( \Sigma^1_1\)-choicearithmetical transfinite recusion

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items

Algebraic properties of the first-order part of a problem, Lawvere-Tierney topologies for computability theorists

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Density of the Medvedev lattice of \(\Pi^0_1\) classes
• A Note On Analytic Sets
• Descending sequences of degrees
• Uniformly defined descending sequences of degrees
• On the algebraic structure of Weihrauch degrees
• Dividing by Zero -- How Bad Is It, Really?
• Weihrauch Complexity in Computable Analysis
• Continuous higher randomness
• Classes of Polish spaces under effective Borel isomorphism
• A note on the hyperarithmetical hierarchy
• SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE