OnlineWoerterBuecher.de
Internes

Lexikon

inclusive


In domain theory, a predicate P : D -> Bool is inclusive iff For any chain C, a subset of D, and for all c in C, P(c) => P(lub C) In other words, if the predicate holds for all elements of an increasing sequence then it holds for their {least upper bound}. ("lub is written in LaTeX as sqcup). (1995-02-03)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ B ] [ b ] [ bo ] [ bs ] [ C ] [ (c) ] [ ca ] [ cat ] [ ch ] [ chain ] [ cl ] [ cr ] [ cu ] [ D ] [ do ] [ domain ] [ domain theory ] [ du ] [ ed ] [ element ] [ er ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ h ] [ hr ] [ id ] [ iff ] [ il ] [ in ] [ inc ] [ ir ] [ is ] [ it ] [ LaTeX ] [ ld ] [ least upper bound ] [ Lex ] [ lu ] [ lub ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ng ] [ om ] [ pe ] [ ph ] [ pr ] [ query ] [ rc ] [ re ] [ se ] [ set ] [ si ] [ sqcup ] [ st ] [ su ] [ T ] [ th ] [ theory ] [ tt ] [ up ] [ upper bound ] [ us ] [ ve ] [ word ] [ X ]






[ Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2870 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.1018 Seconds, with 17 Database-Queries
Zurück zur Startseite