Page "Order-embedding" Paragraph 1
from
Wikipedia
Formally, given two partially ordered sets ( S, ≤) and ( T, ≤), a function f: S → T is an order-embedding if f is both order-preserving and order-reflecting, i. e. for all x and y in S, one has
Page 1 of 1.
1.901 seconds.