Abbreviation: MV
An \emph{MV-algebra} (short for \emph{multivalued logic algebra}) is a structure A=⟨A,+,0,¬⟩ such that
⟨A,+,0⟩ is a commutative monoid
¬¬x=x
x+¬0=¬0
¬(¬x+y)+y=¬(¬y+x)+x
Remark: This is the definition from 1)
Let A and B be MV-algebras. A morphism from A to B is a function h:A→B that is a homomorphism:
h(x+y)=h(x)+h(y), h(¬x)=¬h(x), h(0)=0
An \emph{MV-algebra} is a structure A=⟨A,+,0,⋅,1,¬⟩ such that
⟨A,⋅,1⟩ is a commutative monoid
¬ is a DeMorgan involution for +,⋅: ¬¬x=x, x+y=¬(¬x⋅¬y)
¬0=1, 0⋅x=0, ¬(¬x+y)+y=¬(¬y+x)+x
An \emph{MV-algebra} is a basic logic algebra A=⟨A,∨,0,∧,1,⋅,→⟩ that satisfies
MV: x∨y=(x→y)→y
A \emph{Wajsberg algebra} is an algebra A=⟨A,→,¬,1⟩ such that
1→x=x
(x→y)→((y→z)→(x→z)=1
(x→y)→y=(y→x)→x
(¬x→¬y)→(y→x)=1
Remark: Wajsberg algebras are term-equivalent to MV-algebras via x→y=¬x+y, 1=¬0 and x+y=¬x→y, 0=¬1.
A \emph{bounded Wajsberg hoop} is an algebra A=⟨A,⋅,→,0,1⟩ such that
⟨A,⋅,→,1⟩ is a hoop
(x→y)→y=(y→x)→x
0→x=1
Remark: Bounded Wajsberg hoops are term-equivalent to Wajsberg algebras via x⋅y=¬(x→¬y), 0=¬1, and ¬x=x→0. See 2) for details.
A \emph{lattice implication algebra} is an algebra A=⟨A,→,−,1⟩ such that
x→(y→z)=y→(x→z)
1→x=x
x→1=1
x→y=−y→−x
(x→y)→y=(y→x)→x
Remark: Lattice implication algebras are term-equivalent to MV-algebras via x+y=−x→y, 0=−1, and ¬x=−x.
A \emph{bounded commutative BCK-algebra} is an algebra A=⟨A,⋅,0,1⟩ such that
⟨A,⋅,0⟩ is a commutative BCK-algebra and
x⋅1=0
Remark: Bounded commutative BCK-algebras are term-equivalent to MV-algebras via ¬x=1⋅x, x+y=y⋅¬x, and switching the role of 0, 1.
Example 1:
Classtype | variety |
---|---|
Equational theory | decidable |
Universal theory | decidable (FEP3)) |
First-order theory | |
Locally finite | no |
Residual size | unbounded |
Congruence distributive | yes |
Congruence modular | yes |
Congruence n-permutable | yes, n=2 |
Congruence e-regular | yes, e=1 |
Congruence uniform | |
Congruence extension property | yes |
Definable principal congruences | |
Equationally def. pr. cong. | no |
Amalgamation property | yes 4) |
Strong amalgamation property | |
Epimorphisms are surjective |
n | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
# of algs | 1 | 1 | 1 | 2 | 1 | 2 | 1 | 3 | 2 | 2 | 1 | 4 | 1 | 2 | 2 | 5 | 1 | 4 | 1 | 4 | 2 | 2 | 1 | 7 | 2 |
# of si's | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
The number of algebras with n elements is given by the number of ways of factoring n into a product with nontrivial factors, see http://oeis.org/A001055