OnlineWoerterBuecher.de
Internes

Lexikon


ideal


In domain theory, a non-empty, downward closed subset which is also closed under binary least upper bounds. I.e. anything less than an element is also an element and the least upper bound of any two elements is also an element. (1997-09-26)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ b ] [ bi ] [ binary ] [ bo ] [ bs ] [ ch ] [ cl ] [ de ] [ do ] [ domain ] [ domain theory ] [ down ] [ downward closed ] [ du ] [ ed ] [ element ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ h ] [ hing ] [ hr ] [ id ] [ il ] [ in ] [ is ] [ least upper bound ] [ less than ] [ Lex ] [ lose ] [ ls ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ ng ] [ no ] [ om ] [ pe ] [ ph ] [ pt ] [ query ] [ rc ] [ re ] [ se ] [ set ] [ so ] [ st ] [ su ] [ th ] [ theory ] [ tw ] [ up ] [ upper bound ] [ yt ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2479 Reads)

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

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