Effective choice and boundedness principles in computable analysis
From MaRDI portal
Recommendations
- Effective Choice and Boundedness Principles in Computable Analysis
- Closed choice and a uniform low basis theorem
- Weihrauch degrees, omniscience principles and weak computability
- Weihrauch degrees, omniscience principles and weak computability
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
Cited in
(20)- On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
- On the uniform computational content of the Baire category theorem
- On the uniform computational content of computability theory
- Completion of choice
- Finite choice, convex choice and sorting
- On the computational content of the Brouwer fixed point theorem
- Weihrauch degrees, omniscience principles and weak computability
- On the (semi)lattices induced by continuous reducibilities
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- Well-Quasi Orders and Hierarchy Theory
- Finite choice, convex choice and finding roots
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Closed choice and a uniform low basis theorem
- Effective Brenier Theorem
- scientific article; zbMATH DE number 817189 (Why is no real title available?)
- A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
- Cardinal invariants, non-lowness classes, and Weihrauch reducibility
- Connected choice and the Brouwer fixed point theorem
- How incomputable is the separable Hahn-Banach theorem?
This page was built for publication: Effective choice and boundedness principles in computable analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917342)
