pith. sign in

arxiv: 1210.3285 · v1 · pith:WPLF2FOBnew · submitted 2012-10-11 · 🧮 math.GR

A 2-base for inverse semigroups

classification 🧮 math.GR
keywords baseinversesemigroupsoperationproblemeffortsidentitiesopen
0
0 comments X
read the original abstract

An open problem in the theory of inverse semigroups was whether the variety of such semigroups, when viewed as algebras with a binary operation and a unary operation, is 2-based, that is, has a base for its identities consisting of 2 independent axioms. In this note, we announce the affirmative solution to this problem: the identities \[ \quad x(x'x) = x \qquad \quad x (x' (y (y' ((z u)' w')'))) = y (y' (x (x' ((w z) u)))) \] form a base for inverse semigroups where ${}'$ turns out to be the natural inverse operation. We recount here the history of the problem including our previous efforts to find a 2-base using automated deduction and the method that finally worked. We describe our efforts to simplify the proof using \textsc{Prover9}, present the simplified proof itself and conclude with some open problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.