## 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).

Last updated: 1995-02-03

Loading

(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).

Last updated: 1995-02-03

Loading

Updated: Tue Jun 27 16:32:33 2017

24087 terms

No longer supported by Imperial College Department of Computing

Tweet