OnlineWoerterBuecher.de
Internes

Lexikon


antichain


A subset S of a partially ordered set P is an antichain if, for all x, y in S, x <= y => x = y I.e. no two different elements are related. ("<=" is written in LaTeX as subseteq). (1995-02-03)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ bs ] [ ch ] [ chain ] [ de ] [ diff ] [ du ] [ ed ] [ element ] [ er ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ h ] [ hr ] [ id ] [ iff ] [ il ] [ in ] [ is ] [ it ] [ la ] [ LaTeX ] [ Lex ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ no ] [ pa ] [ partially ordered set ] [ ph ] [ query ] [ rc ] [ re ] [ S ] [ se ] [ set ] [ su ] [ subseteq ] [ T ] [ th ] [ tt ] [ tw ] [ X ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2674 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.1829 Seconds, with 17 Database-Queries
Zurück zur Startseite