Completion of choice
Publication:2220486
DOI10.1016/j.apal.2020.102914zbMath1462.03019arXiv1910.13186MaRDI QIDQ2220486
Publication date: 25 January 2021
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.13186
completion; choice problems; computable analysis; Weihrauch reducibility; totalization; Weihrauch lattice; computable reducibility; classes of computable problems; total Weihrauch reducibility; Weihrauch complexity
03F60: Constructive and recursive analysis
03B30: Foundations of classical theories (including reverse mathematics)
03F35: Second- and higher-order arithmetic and fragments
03D30: Other degrees and reducibilities in computability and recursion theory
03D78: Computation over the reals, computable analysis
Related Items
Cites Work
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Closed choice and a uniform low basis theorem
- Theory of representations
- On the uniform computational content of the Baire category theorem
- A topological view on algebraic computation models
- On the uniform computational content of computability theory
- Joins in the strong Weihrauch degrees
- Probabilistic computability and choice
- The Vitali Covering Theorem in the Weihrauch Lattice
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- Finite choice, convex choice and finding roots
- Borel Complexity of Topological Operations on Computable Metric Spaces
- On the algebraic structure of Weihrauch degrees
- ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM
- Connected choice and the Brouwer fixed point theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
