Computer Science – Logic in Computer Science
Scientific paper
2010-12-30
Computer Science
Logic in Computer Science
to be presented at CCA 2011
Scientific paper
We answer a question by Vasco Brattka and Guido Gherardi by proving that the
Weihrauch-lattice is not a Brouwer algebra. The computable Weihrauch-lattice is
also not a Heyting algebra, but the continuous Weihrauch-lattice is. We further
investigate embeddings of the Medvedev-degrees into the Weihrauch-degrees.
Higuchi Kojiro
Pauly Arno
No associations
LandOfFree
The degree structure of Weihrauch-reducibility does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The degree structure of Weihrauch-reducibility, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The degree structure of Weihrauch-reducibility will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-401301