English

Minimal covers in the Weihrauch degrees

Logic 2024-10-29 v1 Logic in Computer Science

Abstract

In this paper, we study the existence of minimal covers and strong minimal covers in the Weihrauch degrees. We characterize when a problem ff is a minimal cover or strong minimal cover of a problem hh. We show that strong minimal covers only exist in the cone below id\mathsf{id} and that the Weihrauch lattice above id\mathsf{id} is dense. From this, we conclude that the degree of id\mathsf{id} is first-order definable in the Weihrauch degrees and that the first-order theory of the Weihrauch degrees is computably isomorphic to third-order arithmetic.

Keywords

Cite

@article{arxiv.2311.12676,
  title  = {Minimal covers in the Weihrauch degrees},
  author = {Steffen Lempp and Joseph S. Miller and Arno Pauly and Mariya I. Soskova and Manlio Valenti},
  journal= {arXiv preprint arXiv:2311.12676},
  year   = {2024}
}
R2 v1 2026-06-28T13:27:30.612Z