Kojiro Higuchi ; Arno Pauly - The degree structure of Weihrauch-reducibility

lmcs:1124 - Logical Methods in Computer Science, April 2, 2013, Volume 9, Issue 2 - https://doi.org/10.2168/LMCS-9(2:2)2013
The degree structure of Weihrauch-reducibilityArticle

Authors: Kojiro Higuchi ; Arno Pauly

    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 the existence of infinite infima and suprema, as well as embeddings of the Medvedev-degrees into the Weihrauch-degrees.

    https://doi.org/10.2168/LMCS-9(2:2)2013
    Source: arXiv.org:1101.0112
    Volume: Volume 9, Issue 2
    Published on: April 2, 2013
    Imported on: April 2, 2012
    Keywords: Computer Science - Logic in Computer Science
    Licence: arXiv.org - Non-exclusive license to distribute
    Funding:
      Source : OpenAIRE Graph
    • Computable Analysis; Funder: European Commission; Code: 294962

    17 Documents citing this article

    Share and export

    Consultation statistics

    This page has been seen 1626 times.
    This article's PDF has been downloaded 375 times.