−Table of Contents
Commutative BCK-algebras
Abbreviation: ComBCK
Definition
A \emph{commutative BCK-algebra} is a structure A=⟨A,⋅,0⟩ of type ⟨2,0⟩ such that
(1): ((x⋅y)⋅(x⋅z))⋅(z⋅y)=0
(2): x⋅0=x
(3): 0⋅x=0
(4): x⋅y=y⋅x=0⟹x=y
(5): x⋅(x⋅y)=y⋅(y⋅x)
Remark: Note that the commutativity does not refer to the operation ⋅, but rather to the term operation x∧y=x⋅(x⋅y), which turns out to be a meet with respect to the following partial order:
x≤y⟺x⋅y=0, with 0 as least element.
Definition
A \emph{commutative BCK-algebra} is a BCK-algebra A=⟨A,⋅,0⟩ such that
x⋅(x⋅y)=y⋅(y⋅x)
Definition
A \emph{commutative BCK-algebra} is a structure A=⟨A,⋅,0⟩ of type ⟨2,0⟩ such that
(1): (x⋅y)⋅z=(x⋅z)⋅y
(2): x⋅(x⋅y)=y⋅(y⋅x)
(3): x⋅x=0
(4): x⋅0=x
This definition shows that commutative BCK algebras form a variety.
Morphisms
Let A and B be commutative BCK-algebras. A morphism from A to B is a function h:A→B that is a homomorphism:
h(x⋅y)=h(x)⋅h(y) and h(0)=0
Examples
Example 1:
Basic results
Properties
Finite members
f(1)=1f(2)=1f(3)=2f(4)=5f(5)=11f(6)=28f(7)=72f(8)=192