Poset / lattice foundations: reflexive-antisymmetric-transitive ≤ and join/meet

Layer 0 — Mathematicsin the order-theory subtree

A partially-ordered set (P, ≤) is a set P with a binary relation ≤ satisfying reflexivity x ≤ x, antisymmetry x ≤ y ∧ y ≤ x ⇒ x = y, and transitivity x ≤ y ∧ y ≤ z ⇒ x ≤ z. A lattice is a poset in which every pair {x, y} has a least upper…

Related concepts

Explore Poset / lattice foundations: reflexive-antisymmetric-transitive ≤ and join/meet on the interactive knowledge graph →