
TL;DR
This paper demonstrates that the Weihrauch lattice can be transformed into a Brouwer algebra through specific closure operators, introducing a new totalization method and exploring its logical and algebraic properties.
Contribution
It introduces a novel completion closure operator, shows how to obtain a Brouwer algebra from Weihrauch lattice, and analyzes the logical implications and algebraic structure involved.
Findings
The parallelized total Weihrauch lattice forms a Brouwer algebra with a new implication.
The total Weihrauch lattice does not model intuitionistic linear logic.
The Medvedev Brouwer algebra embeds into the constructed Brouwer algebra.
Abstract
We prove that the Weihrauch lattice can be transformed into a Brouwer algebra by the consecutive application of two closure operators in the appropriate order: first completion and then parallelization. The closure operator of completion is a new closure operator that we introduce. It transforms any problem into a total problem on the completion of the respective types, where we allow any value outside of the original domain of the problem. This closure operator is of interest by itself, as it generates a total version of Weihrauch reducibility that is defined like the usual version of Weihrauch reducibility, but in terms of total realizers. From a logical perspective completion can be seen as a way to make problems independent of their premises. Alongside with the completion operator and total Weihrauch reducibility we need to study precomplete representations that are required to…
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.
