The equational theory of the Weihrauch lattice with (iterated) composition
Cécilia Pradic
TL;DR
The paper tackles the equational theory of the Weihrauch lattice under composition and iterations by introducing extended Weihrauch problems and a simulation game based on Büchi automata. It provides a complete axiomatization, $ ext{RSKA}_{digsqcap}$, mirroring right-skewed Kleene-algebra style while handling distributive meets and non-distributivity of $igsqcup$ over $ hd$, and proves soundness and completeness via a novel game-theoretic framework. A key result is that universal validity of inequations in the extended Weihrauch degrees coincides with the existence of winning strategies in the simulation game, yielding decidability; the paper also establishes complexity bounds, proving PSPACE-hardness and offering PSPACE-membership conjectures. The approach connects automata-theoretic methods with algebraic proof systems, providing a foundation for both further theoretical exploration and potential extensions to related Weihrauch degree settings.
Abstract
We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and its iteration $(-)^\diamond$ , which are true however we substitute (slightly extended) Weihrauch degrees for the variables. We characterize them using Büchi games on finite graphs and give a complete axiomatization that derives them. The term signature and the axiomatization are reminiscent of Kleene algebras, except that we additionally have meets and the lattice operations do not fully distributes over composition. The game characterization also implies that it is decidable whether an equation is universally valid. We give some complexity bounds; in particular, the problem is Pspace-hard in general and we conjecture that it is solvable in Pspace.
