On the algebraic structure of Weihrauch degrees

DOI10.23638/LMCS-14(4:4)2018zbMath1454.03053arXiv1604.08348MaRDI QIDQ4553287

Arno Pauly, Vasco Brattka

Publication date: 2 November 2018

Full work available at URL: https://arxiv.org/abs/1604.08348

zbMATH Keywords

substructural logiccomputable analysisWeihrauch lattice

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)

Related Items (29)

An inside/outside Ramsey theorem and recursion theory ⋮ On the uniform computational content of the Baire category theorem ⋮ Reduction games, provability and compactness ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Algebraic properties of the first-order part of a problem ⋮ RANDOMNESS NOTIONS AND REVERSE MATHEMATICS ⋮ On the uniform computational content of computability theory ⋮ On the complexity of learning programs ⋮ The complexity of finding supergraphs ⋮ ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY’S THEOREM ⋮ Parallel and Serial Jumps of Weak Weak König’s Lemma ⋮ Many-one reductions and the category of multivalued functions ⋮ Borel-Piecewise Continuous Reducibility for Uniformization Problems ⋮ How constructive is constructing measures? ⋮ Completion of choice ⋮ Unnamed Item ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Embeddings between well-orderings: computability-theoretic reductions ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ A note on the diamond operator ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ Parallelizations in Weihrauch reducibility and constructive reverse mathematics ⋮ Unnamed Item ⋮ A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES ⋮ Weihrauch Complexity in Computable Analysis ⋮ Universality, optimality, and randomness deficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Closed choice and a uniform low basis theorem
• Concurrent Kleene algebra and its foundations
• Linear logic
• Residuated lattices. An algebraic glimpse at substructural logics
• How incomputable is the separable Hahn-Banach theorem?
• Computable invariance
• Topological properties of real number representations.
• On the uniform computational content of computability theory
• Probabilistic computability and choice
• Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
• Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
• On uniform relationships between combinatorial problems
• An Event Structure Model for Probabilistic Concurrent Kleene Algebra
• The Vitali Covering Theorem in the Weihrauch Lattice
• Many-one reductions and the category of multivalued functions
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch degrees, omniscience principles and weak computability
• Computability of the Radon-Nikodym Derivative
• Algorithmic Randomness and Complexity
• Concurrent Kleene Algebra
• The Brouwer Fixed Point Theorem Revisited
• Finite choice, convex choice and finding roots
• Some remarks on the algebraic structure of the Medvedev Lattice
• ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS
• Incomputability of Simply Connected Planar Continua
• The degree structure of Weihrauch-reducibility
• On the topological aspects of the theory of represented spaces

This page was built for publication: On the algebraic structure of Weihrauch degrees