Pages that link to "Item:Q408156"
From MaRDI portal
The following pages link to The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma (Q408156):
Displaying 45 items.
- Addendum to: ``The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma'' (Q529168) (← links)
- On the uniform computational content of the Baire category theorem (Q1633900) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- On the uniform computational content of computability theory (Q1694010) (← links)
- Embeddings between well-orderings: computability-theoretic reductions (Q1987213) (← links)
- Game characterizations and lower cones in the Weihrauch degrees (Q2011671) (← links)
- A semi-potential for finite and infinite games in extensive form (Q2175356) (← links)
- Completion of choice (Q2220486) (← links)
- Probabilistic computability and choice (Q2346414) (← links)
- Universality, optimality, and randomness deficiency (Q2352258) (← links)
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions (Q2442153) (← links)
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism (Q2637708) (← links)
- On uniform relationships between combinatorial problems (Q2796522) (← links)
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem (Q2841359) (← links)
- The Bolzano-Weierstrass theorem and set-theory (Q2914048) (← links)
- Weihrauch degrees, omniscience principles and weak computability (Q2917341) (← links)
- Effective choice and boundedness principles in computable analysis (Q2917342) (← links)
- The Vitali Covering Theorem in the Weihrauch Lattice (Q2970958) (← links)
- Parallel and Serial Jumps of Weak Weak König’s Lemma (Q2970959) (← links)
- Many-one reductions and the category of multivalued functions (Q2973252) (← links)
- Borel-Piecewise Continuous Reducibility for Uniformization Problems (Q2974788) (← links)
- Weihrauch degrees, omniscience principles and weak computability (Q3083132) (← links)
- Computability and Analysis, a Historical Approach (Q3188239) (← links)
- The Brouwer Fixed Point Theorem Revisited (Q3188240) (← links)
- Generalized Effective Reducibility (Q3188260) (← links)
- Weihrauch Degrees of Finding Equilibria in Sequential Games (Q3195703) (← links)
- On the algebraic structure of Weihrauch degrees (Q4553287) (← links)
- (Q4585068) (← links)
- On computability and disintegration (Q4593233) (← links)
- A comparison of concepts from computable analysis and effective descriptive set theory (Q4593238) (← links)
- ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM (Q4600456) (← links)
- ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS (Q4600462) (← links)
- (Q5015282) (← links)
- Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
- (Q5028441) (← links)
- An inside/outside Ramsey theorem and recursion theory (Q5036108) (← links)
- Effectivity and reducibility with ordinal Turing machines (Q5037207) (← links)
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS (Q5159502) (← links)
- Connected choice and the Brouwer fixed point theorem (Q5223123) (← links)
- Game characterizations and lower cones in the Weihrauch degrees (Q5228881) (← links)
- From Bolzano‐Weierstraß to Arzelà‐Ascoli (Q5419209) (← links)
- SEARCHING FOR AN ANALOGUE OF ATR<sub>0</sub> IN THE WEIHRAUCH LATTICE (Q5855746) (← links)
- WEIHRAUCH GOES BROUWERIAN (Q5858925) (← links)
- Algebraic properties of the first-order part of a problem (Q6040614) (← links)
- Variations of statement, variations of strength. The case of the Rival-Sands theorems (Q6147850) (← links)
