Home
Proofs
Library
Chat
Docs
Notif.
Settings
Sign in
home
library
entries
order theory
Order Theory
Preorder
a ≤ a (reflexive),
(
a
≤
b
)
×
(
b
≤
c
)
→
(
a
≤
c
)
(transitive)
.
Meet
x
∧
y
≤
x
,
x
∧
y
≤
y
,
(
a
≤
x
)
×
(
a
≤
y
)
→
a
≤
x
∧
y
.
Join
x
≤
x
∨
y
,
y
≤
x
∨
y
,
(
x
≤
a
)
×
(
y
≤
a
)
→
x
∨
y
≤
a
.
Partial Order
(
x
≤
y
)
×
(
y
≤
x
)
→ x = y (antisymmetric)
.
Order
Lattice
Comparison with Category Theory
References