Embeddings between well-orderings: computability-theoretic reductions

DOI10.1016/j.apal.2020.102789zbMath1479.03008OpenAlexW3006530830MaRDI QIDQ1987213

Jun Le Goh

Publication date: 14 April 2020

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2020.102789

zbMATH Keywords

reverse mathematicsFraïssé's conjecturearithmetical transfinite recursionWeihrauch reducibility

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items (3)

The computational strength of matchings in countable graphs ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Weak comparability of well orderings and reverse mathematics
• The uniform content of partial and linear orders
• Countable retracing functions and \(\Pi_2^0\) predicates
• On Fraissé's order type conjecture
• On uniform relationships between combinatorial problems
• Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract)
• The Vitali Covering Theorem in the Weihrauch Lattice
• Recursive well-founded orderings
• On the algebraic structure of Weihrauch degrees
• Fraïssé’s conjecture in Π11-comprehension
• Ranked structures and arithmetic transfinite recursion
• Cohesive avoidance and strong reductions
• SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE

This page was built for publication: Embeddings between well-orderings: computability-theoretic reductions