Papers
Topics
Authors
Recent
Search
2000 character limit reached

A 2-base for inverse semigroups

Published 11 Oct 2012 in math.GR | (1210.3285v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.