Pages that link to "Item:Q3159400"
From MaRDI portal
The following pages link to Effective Borel measurability and reducibility of functions (Q3159400):
Displayed 33 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)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Borel complexity and computability of the Hahn-Banach theorem (Q926175) (← links)
- A computable version of Banach's inverse mapping theorem (Q1006604) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- Computability, noncomputability, and hyperbolic systems (Q2018989) (← 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 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)
- Computability of the Radon-Nikodym Derivative (Q3091448) (← links)
- Computability and Analysis, a Historical Approach (Q3188239) (← links)
- On the existence of a connected component of a graph (Q3195646) (← links)
- Weihrauch Degrees of Finding Equilibria in Sequential Games (Q3195703) (← links)
- Towards the Effective Descriptive Set Theory (Q3195711) (← links)
- Hierarchies of function classes defined by the first-value operator (Q3515461) (← links)
- Singular coverings and non‐uniform notions of closed set computability (Q3528149) (← 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)
- Computing links and accessing arcs (Q4915223) (← links)
- Computability and Representations of the Zero Set (Q4918003) (← links)
- How Incomputable is the Separable Hahn-Banach Theorem? (Q4918007) (← links)
- Singular Coverings and Non-Uniform Notions of Closed Set Computability (Q4918031) (← links)
- Revising Type-2 Computation and Degrees of Discontinuity (Q4921445) (← links)
- Decomposing Borel functions using the Shore–Slaman join theorem (Q4983474) (← links)
- 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 (Q5387300) (← links)
- On the topological aspects of the theory of represented spaces (Q5740207) (← links)