OnlineWoerterBuecher.de
Internes

Lexikon


lattice


A partially ordered set in which all finite subsets have a least upper bound and greatest lower bound. This definition has been standard at least since the 1930s and probably since Dedekind worked on lattice theory in the 19th century though he may not have used that name. See also complete lattice, domain theory. (1999-12-09)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ av ] [ b ] [ ba ] [ be ] [ bo ] [ bs ] [ ch ] [ co ] [ com ] [ complete ] [ complete lattice ] [ D ] [ de ] [ do ] [ domain ] [ domain theory ] [ du ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ finite ] [ gh ] [ gr ] [ greatest lower bound ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ inc ] [ io ] [ is ] [ it ] [ ke ] [ ki ] [ la ] [ least upper bound ] [ Lex ] [ ls ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ni ] [ no ] [ om ] [ pa ] [ partially ordered set ] [ pe ] [ ph ] [ pl ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ S ] [ se ] [ set ] [ si ] [ so ] [ st ] [ standard ] [ su ] [ T ] [ test ] [ th ] [ theory ] [ tt ] [ ug ] [ up ] [ upper bound ] [ us ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3374 Reads)

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

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