−Table of Contents
Order algebras
Abbreviation: OrdA
Definition
An \emph{order algebra} is a structure A=⟨A,⋅⟩, where ⋅ is an infix binary operation such that
⋅ is idempotent: x⋅x=x
(x⋅y)⋅x=y⋅x
(x⋅y)⋅y=x⋅y
x⋅((x⋅y)⋅z)=x⋅(y⋅z)
((x⋅y)⋅z)⋅y=(x⋅z)⋅y
Remark:
Morphisms
Let A and B be order algebras. A morphism from A to B is a function h:A→B that is a homomorphism:
h(xy)=h(x)h(y)
Examples
Example 1:
Basic results
Properties
Finite members
f(1)=1f(2)=f(3)=f(4)=f(5)=f(6)=f(7)=