When I say "ring-like algebra" I mean two binary operations, "addition" and "multiplication", such that multiplication distributes over addition on at least one side, and addition has at least a one-sided additive identity, but no other requirements are imposed - i.e. neither operation need be associative, commutative, etc.
My goal is to find the minimal axioms not themselves including that the additive identity is absorbing for multiplication, which are sufficient to prove that it is. By minimal, I mean proving the "fewest" theorems - that is, the resulting set of theorems being a proper subset of any set of theorems describing any other variety of algebra which have this property. A better way to say it may be I'm looking for the largest variety in which every algebra satisfies these constraints. (I'm still getting used to the terminology.)
So far I have the following:
Given the signature (S,+,*,(-),0), where S is a set, + and * are binary functions S×S→S (with * written by concatenation), (-) is a unary function S→S, and 0 is a constant element of S, and the following axioms (all variables universally quantified over elements of S):
- a = 0 + a
- (a+b)c = ac + bc
- b = (b+a) + (-a)
then we can prove:
- a = 0 + a
- ab = (0+a)b = 0b + ab
- ab + (-ab) = (0b+ab) + (-ab)
- ab + (-ab) = 0b
- (0+ab) + (-ab) = 0b
- 0 = 0b
What I want to know is, is there a larger variety containing the first two axioms in which the same result can be proven? More generally, can some variety be proven to be the largest for which every algebra satisfies these requirements?