FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS

DOI10.1017/jsl.2021.15OpenAlexW3091973211MaRDI QIDQ5159502

Jun Le Goh, Arno Pauly, Manlio Valenti

Publication date: 27 October 2021

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

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

zbMATH Keywords

reverse mathematicscomputable analysisWeihrauch reducibilitywell-quasiorders

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78) Generalizations of ordered sets (06A75)

Related Items (3)

Algebraic properties of the first-order part of a problem ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Lawvere-Tierney topologies for computability theorists

Cites Work

• 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
• The weakness of being cohesive, thin or free in reverse mathematics
• The maximal linear extension theorem in second order arithmetic
• Mass problems and intuitionism
• How incomputable is the separable Hahn-Banach theorem?
• Harvey Friedman's research on the foundations of mathematics
• A topological view on algebraic computation models
• Completion of choice
• Probabilistic computability and choice
• The uniform content of partial and linear orders
• On uniform relationships between combinatorial problems
• The Vitali Covering Theorem in the Weihrauch Lattice
• Weihrauch degrees, omniscience principles and weak computability
• Effective Borel measurability and reducibility of functions
• Combinatorial principles weaker than Ramsey's Theorem for pairs
• Finite choice, convex choice and finding roots
• Stability and posets
• Uniformly defined descending sequences of degrees
• On the algebraic structure of Weihrauch degrees
• A comparison of concepts from computable analysis and effective descriptive set theory
• ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
• Descriptive Set Theory in the Category of Represented Spaces
• Monte Carlo Computability
• Ramsey’s theorem and products in the Weihrauch degrees
• Degrees of unsolvability of continuous functions
• Recursive Pseudo-Well-Orderings
• On the topological aspects of the theory of represented spaces
• SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE
• WEIHRAUCH GOES BROUWERIAN

This page was built for publication: FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS