You are here: irt.org | FOLDOC | antichain
<mathematics> A subset S of a partially ordered set P is an antichain if,
for all x, y in S, x <= y => x = yI.e. no two different elements are related.
("<=" is written in LaTeX as \subseteq).
(1995-02-03)
Nearby terms: antenna gain « Anthony Hoare « anti-aliasing « antichain » antisymmetric » antivirus » antivirus program
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL