Pages that link to "Item:Q2917342"

The following pages link to Effective choice and boundedness principles in computable analysis (Q2917342):

Displaying 13 items.

• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma (Q408156) (← links)
• Closed choice and a uniform low basis theorem (Q424541) (← links)
• On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis (Q1102283) (← links)
• On the uniform computational content of computability theory (Q1694010) (← links)
• Completion of choice (Q2220486) (← links)
• Weihrauch degrees, omniscience principles and weak computability (Q2917341) (← links)
• On the (semi)lattices induced by continuous reducibilities (Q3053230) (← links)
• Weihrauch degrees, omniscience principles and weak computability (Q3083132) (← links)
• Effective Choice and Boundedness Principles in Computable Analysis (Q3083466) (← links)
• Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
• Effective Brenier Theorem (Q4635935) (← links)
• (Q4854624) (← links)
• Connected choice and the Brouwer fixed point theorem (Q5223123) (← links)