−Table of Contents
Residuated lattices
Abbreviation: RL
Definition
A \emph{residuated lattice} is a structure L=⟨L,∨,∧,⋅,e,∖,/⟩ of type ⟨2,2,2,0,2,2⟩ such that
⟨L,⋅,e⟩ is a monoid
⟨L,∨,∧⟩ is a lattice
∖ is the left residual of ⋅: y≤x∖z⟺xy≤z
/ is the right residual of ⋅: x≤z/y⟺xy≤z
Morphisms
Let L and M be residuated lattices. A morphism from L to M is a function h:L→M that is a homomorphism:
h(x∨y)=h(x)∨h(y), h(x∧y)=h(x)∧h(y), h(x⋅y)=h(x)⋅h(y), h(x∖y)=h(x)∖h(y), h(x/y)=h(x)/h(y), h(e)=e
Examples
Example 1:
Basic results
Properties
Classtype | variety |
---|---|
Equational theory | decidable 1) implementation |
Quasiequational theory | undecidable |
First-order theory | undecidable |
Locally finite | no |
Residual size | unbounded |
Congruence distributive | yes |
Congruence modular | yes |
Congruence n-permutable | yes, n=2 |
Congruence regular | no |
Congruence e-regular | yes |
Congruence uniform | no |
Congruence extension property | no |
Definable principal congruences | no |
Equationally def. pr. cong. | no |
Amalgamation property | |
Strong amalgamation property | |
Epimorphisms are surjective |
Finite members
f(1)=1f(2)=1f(3)=3f(4)=20f(5)=149f(6)=1488f(7)=18554f(8)=295292
Subclasses
Superclasses
References
2)\end{document} %</pre>