Pages that link to "Item:Q3083466"
From MaRDI portal
The following pages link to Effective Choice and Boundedness Principles in Computable Analysis (Q3083466):
Displaying 50 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)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- On the uniform computational content of the Baire category theorem (Q1633900) (← links)
- Comparing representations for function spaces in computable analysis (Q1635809) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- On the uniform computational content of computability theory (Q1694010) (← links)
- Towards computable analysis on the generalised real line (Q2011660) (← links)
- Game characterizations and lower cones in the Weihrauch degrees (Q2011671) (← links)
- Parallelizations in Weihrauch reducibility and constructive reverse mathematics (Q2106590) (← links)
- Completion of choice (Q2220486) (← links)
- Using Ramsey's theorem once (Q2274133) (← links)
- The strength of compactness in computability theory and nonstandard analysis (Q2326415) (← 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)
- A New Closed Graph Theorem on Product Spaces (Q2812617) (← links)
- Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) (Q2946357) (← links)
- Reverse Mathematics of Matroids (Q2970956) (← links)
- The Vitali Covering Theorem in the Weihrauch Lattice (Q2970958) (← 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)
- Complexity Issues for Preorders on Finite Labeled Forests (Q3091446) (← links)
- Computability of the Radon-Nikodym Derivative (Q3091448) (← links)
- Computability and Analysis, a Historical Approach (Q3188239) (← links)
- The Brouwer Fixed Point Theorem Revisited (Q3188240) (← links)
- A Candidate for the Generalised Real Line (Q3188265) (← links)
- On the existence of a connected component of a graph (Q3195646) (← links)
- Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ (Q3195695) (← links)
- Weihrauch Degrees of Finding Equilibria in Sequential Games (Q3195703) (← 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)
- (Q4643953) (← links)
- Decomposing Borel functions using the Shore–Slaman join theorem (Q4983474) (← links)
- (Q4989411) (← links)
- Weihrauch and constructive reducibility between existence statements (Q4995601) (← links)
- Bishop-Style Constructive Reverse Mathematics (Q5024576) (← links)
- Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
- (Q5028441) (← links)
- Connected choice and the Brouwer fixed point theorem (Q5223123) (← links)
- Game characterizations and lower cones in the Weihrauch degrees (Q5228881) (← links)
- On the strength of marriage theorems and uniformity (Q5419204) (← links)
- From Bolzano‐Weierstraß to Arzelà‐Ascoli (Q5419209) (← links)
- Representations of Analytic Functions and Weihrauch Degrees (Q5740198) (← links)
- Wadge-like reducibilities on arbitrary quasi-Polish spaces (Q5740679) (← links)
- SEARCHING FOR AN ANALOGUE OF ATR<sub>0</sub> IN THE WEIHRAUCH LATTICE (Q5855746) (← links)
