Abbreviation: BGrp
A \emph{Boolean group} is a monoid M=⟨M,⋅,e⟩ such that
every element has order 2: x⋅x=e.
Let M and N be Boolean groups. A morphism from M to N is a function h:M→N that is a homomorphism:
h(x⋅y)=h(x)⋅h(y), h(e)=e
Example 1: ⟨{0,1},+,0⟩, the two-element group with addition-mod-2. This algebra generates the variety of Boolean groups.
Classtype | variety |
---|---|
Equational theory | decidable in polynomial time |
Quasiequational theory | decidable |
First-order theory | decidable |
Locally finite | yes |
Residual size | 2 |
Congruence distributive | no |
Congruence modular | yes |
Congruence n-permutable | yes, n=2 |
Congruence regular | yes |
Congruence uniform | yes |
Congruence extension property | yes |
Definable principal congruences | |
Equationally def. pr. cong. | no |
Amalgamation property | |
Strong amalgamation property | |
Epimorphisms are surjective |
f(1)=1f(2)=1f(3)=0f(4)=1f(5)=0f(6)=0f(7)=0f(8)=1