OnlineWoerterBuecher.de
Internes

Lexikon


complete lattice


A ef="module.php?name=Lexikon&file=search&eid=1&query=lattice">lattice is a ef="module.php?name=Lexikon&file=search&eid=1&query=partial ordering">partial ordering of a set under a relation where all finite subsets have a ef="module.php?name=Lexikon&file=search&eid=1&query=least upper bound">least upper bound and a ef="module.php?name=Lexikon&file=search&eid=1&query=greatest lower bound">greatest lower bound. A complete lattice also has these for infinite subsets. every finite lattice is complete. Some authors drop the requirement for ef="module.php?name=Lexikon&file=search&eid=1&query=greatest lower bound">greatest lower bounds. (1994-12-02)

e="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">In addition suitable contents:
[ ef="module.php?name=Lexikon&op=content&tid=31">2 ] [ ef="module.php?name=Lexikon&op=content&tid=134">= ] [ ef="module.php?name=Lexikon&op=content&tid=433">al ] [ ef="module.php?name=Lexikon&op=content&tid=544">am ] [ ef="module.php?name=Lexikon&op=content&tid=592">an ] [ ef="module.php?name=Lexikon&op=content&tid=740">ar ] [ ef="module.php?name=Lexikon&op=content&tid=743">arc ] [ ef="module.php?name=Lexikon&op=content&tid=800">as ] [ ef="module.php?name=Lexikon&op=content&tid=894">at ] [ ef="module.php?name=Lexikon&op=content&tid=935">au ] [ ef="module.php?name=Lexikon&op=content&tid=996">av ] [ ef="module.php?name=Lexikon&op=content&tid=1026">b ] [ ef="module.php?name=Lexikon&op=content&tid=1444">bo ] [ ef="module.php?name=Lexikon&op=content&tid=1606">bs ] [ ef="module.php?name=Lexikon&op=content&tid=2001">ch ] [ ef="module.php?name=Lexikon&op=content&tid=2247">co ] [ ef="module.php?name=Lexikon&op=content&tid=2330">com ] [ ef="module.php?name=Lexikon&op=content&tid=2441">complete ] [ ef="module.php?name=Lexikon&op=content&tid=3151">de ] [ ef="module.php?name=Lexikon&op=content&tid=3752">du ] [ ef="module.php?name=Lexikon&op=content&tid=3834">e ] [ ef="module.php?name=Lexikon&op=content&tid=4148">er ] [ ef="module.php?name=Lexikon&op=content&tid=4171">es ] [ ef="module.php?name=Lexikon&op=content&tid=4199">et ] [ ef="module.php?name=Lexikon&op=content&tid=4497">fi ] [ ef="module.php?name=Lexikon&op=content&tid=4520">file ] [ ef="module.php?name=Lexikon&op=content&tid=4559">finite ] [ ef="module.php?name=Lexikon&op=content&tid=4700">fo ] [ ef="module.php?name=Lexikon&op=content&tid=4727">for ] [ ef="module.php?name=Lexikon&op=content&tid=5291">gr ] [ ef="module.php?name=Lexikon&op=content&tid=5341">greatest lower bound ] [ ef="module.php?name=Lexikon&op=content&tid=5434">h ] [ ef="module.php?name=Lexikon&op=content&tid=5768">hr ] [ ef="module.php?name=Lexikon&op=content&tid=5931">id ] [ ef="module.php?name=Lexikon&op=content&tid=6013">il ] [ ef="module.php?name=Lexikon&op=content&tid=6064">in ] [ ef="module.php?name=Lexikon&op=content&tid=6103">infinite ] [ ef="module.php?name=Lexikon&op=content&tid=6413">io ] [ ef="module.php?name=Lexikon&op=content&tid=6449">ir ] [ ef="module.php?name=Lexikon&op=content&tid=6482">is ] [ ef="module.php?name=Lexikon&op=content&tid=6558">it ] [ ef="module.php?name=Lexikon&op=content&tid=6918">la ] [ ef="module.php?name=Lexikon&op=content&tid=6991">lattice ] [ ef="module.php?name=Lexikon&op=content&tid=7048">least upper bound ] [ ef="module.php?name=Lexikon&op=content&tid=7091">Lex ] [ ef="module.php?name=Lexikon&op=content&tid=7399">ls ] [ ef="module.php?name=Lexikon&op=content&tid=8032">mo ] [ ef="module.php?name=Lexikon&op=content&tid=8040">mod ] [ ef="module.php?name=Lexikon&op=content&tid=8079">module ] [ ef="module.php?name=Lexikon&op=content&tid=8167">mp ] [ ef="module.php?name=Lexikon&op=content&tid=8386">na ] [ ef="module.php?name=Lexikon&op=content&tid=8622">nf ] [ ef="module.php?name=Lexikon&op=content&tid=8627">ng ] [ ef="module.php?name=Lexikon&op=content&tid=8630">ni ] [ ef="module.php?name=Lexikon&op=content&tid=8964">om ] [ ef="module.php?name=Lexikon&op=content&tid=9014">op ] [ ef="module.php?name=Lexikon&op=content&tid=9115">ordering ] [ ef="module.php?name=Lexikon&op=content&tid=9204">pa ] [ ef="module.php?name=Lexikon&op=content&tid=9335">partial ordering ] [ ef="module.php?name=Lexikon&op=content&tid=9457">pe ] [ ef="module.php?name=Lexikon&op=content&tid=9550">ph ] [ ef="module.php?name=Lexikon&op=content&tid=9651">pl ] [ ef="module.php?name=Lexikon&op=content&tid=10253">query ] [ ef="module.php?name=Lexikon&op=content&tid=10364">rc ] [ ef="module.php?name=Lexikon&op=content&tid=10385">re ] [ ef="module.php?name=Lexikon&op=content&tid=10508">relation ] [ ef="module.php?name=Lexikon&op=content&tid=10767">ro ] [ ef="module.php?name=Lexikon&op=content&tid=10918">S ] [ ef="module.php?name=Lexikon&op=content&tid=11150">se ] [ ef="module.php?name=Lexikon&op=content&tid=11281">set ] [ ef="module.php?name=Lexikon&op=content&tid=11651">so ] [ ef="module.php?name=Lexikon&op=content&tid=11934">st ] [ ef="module.php?name=Lexikon&op=content&tid=12133">su ] [ ef="module.php?name=Lexikon&op=content&tid=12557">test ] [ ef="module.php?name=Lexikon&op=content&tid=12588">th ] [ ef="module.php?name=Lexikon&op=content&tid=12896">tt ] [ ef="module.php?name=Lexikon&op=content&tid=13146">up ] [ ef="module.php?name=Lexikon&op=content&tid=13155">upper bound ] [ ef="module.php?name=Lexikon&op=content&tid=13310">ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3623 Reads)

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

Page Generation in 0.0912 Seconds, with 16 Database-Queries
Zurück zur Startseite