On the first-order parts of problems in the Weihrauch degrees
Damir D. Dzhafarov, Reed Solomon, Keita Yokoyama

TL;DR
This paper introduces the concept of the first-order part of problems within the Weihrauch degrees, establishing its properties and characterizing it for well-known problems, thereby advancing the understanding of problem reducibility.
Contribution
It defines the first-order part of a problem in the Weihrauch degrees, proves its existence, and characterizes it for several classical problems.
Findings
The first-order part is always well-defined.
Basic properties of the first-order part are established.
Characterizations are provided for several known problems.
Abstract
We introduce the notion of the \emph{first-order part} of a problem in the Weihrauch degrees. Informally, the first-order part of a problem is the strongest problem with codomaixn that is Weihrauch reducible to . We show that the first-order part is always well-defined, examine some of the basic properties of this notion, and characterize the first-order parts of several well-known problems from the literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Analytic Number Theory Research
