On the (semi)lattices induced by continuous reducibilities
From MaRDI portal
Publication:3053230
DOI10.1002/malq.200910104zbMath1200.03028OpenAlexW3099840387MaRDI QIDQ3053230
Publication date: 4 November 2010
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://cronfa.swan.ac.uk/Record/cronfa36026/Download/0036026-18122017154717.pdf
Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)
Related Items (26)
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 ⋮ A topological view on algebraic computation models ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma ⋮ THE DISCONTINUITY PROBLEM ⋮ On the uniform computational content of computability theory ⋮ 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 ⋮ The Vitali Covering Theorem in the Weihrauch Lattice ⋮ Many-one reductions and the category of multivalued functions ⋮ Borel-Piecewise Continuous Reducibility for Uniformization Problems ⋮ On the algebraic structure of Weihrauch degrees ⋮ On uniform relationships between combinatorial problems ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ Probabilistic computability and choice ⋮ Unnamed Item ⋮ Weihrauch Complexity in Computable Analysis ⋮ Universality, optimality, and randomness deficiency
Cites Work
This page was built for publication: On the (semi)lattices induced by continuous reducibilities
