Weihrauch degrees, omniscience principles and weak computability
From MaRDI portal
Publication:3083132
DOI10.2178/jsl/1294170993zbMath1222.03071arXiv0905.4679OpenAlexW3106040729MaRDI QIDQ3083132
Publication date: 18 March 2011
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.4679
Descriptive set theory (03E15) Constructive and recursive analysis (03F60) Foundations of classical theories (including reverse mathematics) (03B30) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)
Related Items (60)
An inside/outside Ramsey theorem and recursion theory ⋮ Genericity of weakly computable objects ⋮ Three topological reducibilities for discontinuous functions ⋮ On the uniform computational content of the Baire category theorem ⋮ Comparing representations for function spaces in computable analysis ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Computability and Analysis, a Historical Approach ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ On the existence of a connected component of a graph ⋮ Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ ⋮ Weihrauch Degrees of Finding Equilibria in Sequential Games ⋮ Relative computability and uniform continuity of relations ⋮ The reverse mathematics of non-decreasing subsequences ⋮ Basic subtoposes of the effective topos ⋮ A topological view on algebraic computation models ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Algebraic properties of the first-order part of a problem ⋮ Primitive recursive reverse mathematics ⋮ Banach’s theorem in higher-order reverse mathematics ⋮ On computability and disintegration ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ On the uniform computational content of computability theory ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS ⋮ Closed choice and a uniform low basis theorem ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Reverse Mathematics of Matroids ⋮ The Vitali Covering Theorem in the Weihrauch Lattice ⋮ Parallel and Serial Jumps of Weak Weak König’s Lemma ⋮ Computability of finite-dimensional linear subspaces and best approximation ⋮ Many-one reductions and the category of multivalued functions ⋮ Borel-Piecewise Continuous Reducibility for Uniformization Problems ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Completion of choice ⋮ Unnamed Item ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ On the algebraic structure of Weihrauch degrees ⋮ On the strength of marriage theorems and uniformity ⋮ Wadge-like reducibilities on arbitrary quasi-Polish spaces ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ On uniform relationships between combinatorial problems ⋮ Unnamed Item ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Complexity Issues for Preorders on Finite Labeled Forests ⋮ Computability of the Radon-Nikodym Derivative ⋮ Weihrauch and constructive reducibility between existence statements ⋮ THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ Unnamed Item ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ Probabilistic computability and choice ⋮ Parallelizations in Weihrauch reducibility and constructive reverse mathematics ⋮ Unnamed Item ⋮ Bishop-Style Constructive Reverse Mathematics ⋮ Weihrauch Complexity in Computable Analysis ⋮ Universality, optimality, and randomness deficiency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation
- How incomputable is the separable Hahn-Banach theorem?
- Computable invariance
- Computability on subsets of metric spaces.
- Extended admissibility.
- Some conservation results on weak König's lemma
- Effective Choice and Boundedness Principles in Computable Analysis
- Effective Borel measurability and reducibility of functions
- Unique solutions
- Corrigendum to “Unique solutions”
- Plottable Real Number Functions and the Computable Graph Theorem
- Computational complexity on computable metric spaces
This page was built for publication: Weihrauch degrees, omniscience principles and weak computability
