Abbreviation: ConBin
A \emph{conjugative binar} is a binar A=⟨A,⋅⟩ such that
⋅ is conjugative: ∃w, x⋅w=y⟺∃w, w⋅x=y.
Let A and B be commutative binars. A morphism from A to B is a function h:A→B that is a homomorphism:
h(x⋅y)=h(x)⋅h(y)
Example 1:
n | # of algebras |
---|---|
1 | 1 |
2 | 4 |
3 | 215 |