English Computing Dictionary
◊ ORDER-EMBEDDING
order-embedding
A function f : D -> C is order-embedding iff for all x, y in
D,
f(x) <◦ f(y) <◦> x <◦ y.
I.e. arguments and results compare similarly. A function which
is order-embedding is {monotonic} and one-to-one and an
{injection}.
("<◦" is written in {LaTeX} as {\sqsubseteq}).
(1995-02-03)