The degree structure of Weihrauch-reducibility
From MaRDI portal
Publication:4927424
DOI10.2168/LMCS-9(2:2)2013zbMath1271.03057OpenAlexW2137505175MaRDI QIDQ4927424
Publication date: 20 June 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-9(2:2)2013
Other degrees and reducibilities in computability and recursion theory (03D30) Intermediate logics (03B55) Computation over the reals, computable analysis (03D78)
Related Items (15)
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ A topological view on algebraic computation models ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ On the uniform computational content of computability theory ⋮ Many-one reductions and the category of multivalued functions ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ On the algebraic structure of Weihrauch degrees ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ THE OPEN AND CLOPEN RAMSEY THEOREMS IN THE WEIHRAUCH LATTICE ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ Probabilistic computability and choice ⋮ Unnamed Item ⋮ Weihrauch Complexity in Computable Analysis
This page was built for publication: The degree structure of Weihrauch-reducibility