SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE

DOI10.1017/JSL.2020.12zbMath1473.03026arXiv1812.01549OpenAlexW3041438237MaRDI QIDQ5855746

Takayuki Kihara, Alberto Marcone, Arno Pauly

Publication date: 19 March 2021

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

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

zbMATH Keywords

ATRreverse mathematicsperfect set theoremclosed choiceopen determinacyWeihrauch degreesclopen determinacyCWOcomparability of well-orders

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)

Related Items (12)

Reverse mathematics and Weihrauch analysis motivated by finite complexity theory ⋮ ON THE UNCOUNTABILITY OF ⋮ The computational strength of matchings in countable graphs ⋮ Algebraic properties of the first-order part of a problem ⋮ Notes on overt choice ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Embeddings between well-orderings: computability-theoretic reductions ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ Searching problems above arithmetical transfinite recursion ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Closed choice and a uniform low basis theorem
• Weak comparability of well orderings and reverse mathematics
• How incomputable is the separable Hahn-Banach theorem?
• A topological view on algebraic computation models
• Embeddings between well-orderings: computability-theoretic reductions
• Joins in the strong Weihrauch degrees
• Probabilistic computability and choice
• Complexity of winning strategies
• RANDOMNESS IN THE HIGHER SETTING
• Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)
• The Vitali Covering Theorem in the Weihrauch Lattice
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• Effective Borel measurability and reducibility of functions
• Slicing the Truth
• Weihrauch Degrees of Finding Equilibria in Sequential Games
• Hierarchies of number-theoretic predicates
• On the Π₁ ¹ -separation principle
• On the algebraic structure of Weihrauch degrees
• A comparison of concepts from computable analysis and effective descriptive set theory
• Dividing by Zero -- How Bad Is It, Really?
• The degree structure of Weihrauch-reducibility
• Ramsey’s theorem and products in the Weihrauch degrees
• Game characterizations and lower cones in the Weihrauch degrees
• Continuous higher randomness
• ∏ 0 1 Classes and Degrees of Theories
• On the topological aspects of the theory of represented spaces

This page was built for publication: SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE