OnlineWoerterBuecher.de
Internes

Lexikon


inclusive


In ref="module.php?name=Lexikon&file=search&eid=1&query=domain theory">domain theory, a ref="module.php?name=Lexikon&file=search&eid=1&query=predicate">predicate P : D -> Bool is inclusive iff For any ref="module.php?name=Lexikon&file=search&eid=1&query=chain">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 ref="module.php?name=Lexikon&file=search&eid=1&query=LaTeX">LaTeX as ref="module.php?name=Lexikon&file=search&eid=1&query=sqcup">sqcup). (1995-02-03)

In addition suitable contents:
[ ref="module.php?name=Lexikon&op=content&tid=31">2 ] [ ref="module.php?name=Lexikon&op=content&tid=134">= ] [ ref="module.php?name=Lexikon&op=content&tid=411">ai ] [ ref="module.php?name=Lexikon&op=content&tid=433">al ] [ ref="module.php?name=Lexikon&op=content&tid=544">am ] [ ref="module.php?name=Lexikon&op=content&tid=592">an ] [ ref="module.php?name=Lexikon&op=content&tid=740">ar ] [ ref="module.php?name=Lexikon&op=content&tid=743">arc ] [ ref="module.php?name=Lexikon&op=content&tid=800">as ] [ ref="module.php?name=Lexikon&op=content&tid=894">at ] [ ref="module.php?name=Lexikon&op=content&tid=1025">B ] [ ref="module.php?name=Lexikon&op=content&tid=1026">b ] [ ref="module.php?name=Lexikon&op=content&tid=1444">bo ] [ ref="module.php?name=Lexikon&op=content&tid=1606">bs ] [ ref="module.php?name=Lexikon&op=content&tid=1708">C ] [ ref="module.php?name=Lexikon&op=content&tid=1710">(c) ] [ ref="module.php?name=Lexikon&op=content&tid=1724">ca ] [ ref="module.php?name=Lexikon&op=content&tid=1863">cat ] [ ref="module.php?name=Lexikon&op=content&tid=2001">ch ] [ ref="module.php?name=Lexikon&op=content&tid=2005">chain ] [ ref="module.php?name=Lexikon&op=content&tid=2138">cl ] [ ref="module.php?name=Lexikon&op=content&tid=2791">cr ] [ ref="module.php?name=Lexikon&op=content&tid=2900">cu ] [ ref="module.php?name=Lexikon&op=content&tid=2976">D ] [ ref="module.php?name=Lexikon&op=content&tid=3565">do ] [ ref="module.php?name=Lexikon&op=content&tid=3595">domain ] [ ref="module.php?name=Lexikon&op=content&tid=3611">domain theory ] [ ref="module.php?name=Lexikon&op=content&tid=3752">du ] [ ref="module.php?name=Lexikon&op=content&tid=3896">ed ] [ ref="module.php?name=Lexikon&op=content&tid=4008">element ] [ ref="module.php?name=Lexikon&op=content&tid=4148">er ] [ ref="module.php?name=Lexikon&op=content&tid=4199">et ] [ ref="module.php?name=Lexikon&op=content&tid=4497">fi ] [ ref="module.php?name=Lexikon&op=content&tid=4520">file ] [ ref="module.php?name=Lexikon&op=content&tid=4700">fo ] [ ref="module.php?name=Lexikon&op=content&tid=4727">for ] [ ref="module.php?name=Lexikon&op=content&tid=5434">h ] [ ref="module.php?name=Lexikon&op=content&tid=5768">hr ] [ ref="module.php?name=Lexikon&op=content&tid=5931">id ] [ ref="module.php?name=Lexikon&op=content&tid=5986">iff ] [ ref="module.php?name=Lexikon&op=content&tid=6013">il ] [ ref="module.php?name=Lexikon&op=content&tid=6064">in ] [ ref="module.php?name=Lexikon&op=content&tid=6068">inc ] [ ref="module.php?name=Lexikon&op=content&tid=6449">ir ] [ ref="module.php?name=Lexikon&op=content&tid=6482">is ] [ ref="module.php?name=Lexikon&op=content&tid=6558">it ] [ ref="module.php?name=Lexikon&op=content&tid=6989">LaTeX ] [ ref="module.php?name=Lexikon&op=content&tid=7023">ld ] [ ref="module.php?name=Lexikon&op=content&tid=7048">least upper bound ] [ ref="module.php?name=Lexikon&op=content&tid=7091">Lex ] [ ref="module.php?name=Lexikon&op=content&tid=7415">lu ] [ ref="module.php?name=Lexikon&op=content&tid=7417">lub ] [ ref="module.php?name=Lexikon&op=content&tid=7463">ma ] [ ref="module.php?name=Lexikon&op=content&tid=8032">mo ] [ ref="module.php?name=Lexikon&op=content&tid=8040">mod ] [ ref="module.php?name=Lexikon&op=content&tid=8079">module ] [ ref="module.php?name=Lexikon&op=content&tid=8386">na ] [ ref="module.php?name=Lexikon&op=content&tid=8460">nc ] [ ref="module.php?name=Lexikon&op=content&tid=8627">ng ] [ ref="module.php?name=Lexikon&op=content&tid=8964">om ] [ ref="module.php?name=Lexikon&op=content&tid=9457">pe ] [ ref="module.php?name=Lexikon&op=content&tid=9550">ph ] [ ref="module.php?name=Lexikon&op=content&tid=9908">pr ] [ ref="module.php?name=Lexikon&op=content&tid=10253">query ] [ ref="module.php?name=Lexikon&op=content&tid=10364">rc ] [ ref="module.php?name=Lexikon&op=content&tid=10385">re ] [ ref="module.php?name=Lexikon&op=content&tid=11150">se ] [ ref="module.php?name=Lexikon&op=content&tid=11281">set ] [ ref="module.php?name=Lexikon&op=content&tid=11376">si ] [ ref="module.php?name=Lexikon&op=content&tid=11887">sqcup ] [ ref="module.php?name=Lexikon&op=content&tid=11934">st ] [ ref="module.php?name=Lexikon&op=content&tid=12133">su ] [ ref="module.php?name=Lexikon&op=content&tid=12359">T ] [ ref="module.php?name=Lexikon&op=content&tid=12588">th ] [ ref="module.php?name=Lexikon&op=content&tid=12602">theory ] [ ref="module.php?name=Lexikon&op=content&tid=12896">tt ] [ ref="module.php?name=Lexikon&op=content&tid=13146">up ] [ ref="module.php?name=Lexikon&op=content&tid=13155">upper bound ] [ ref="module.php?name=Lexikon&op=content&tid=13175">us ] [ ref="module.php?name=Lexikon&op=content&tid=13310">ve ] [ ref="module.php?name=Lexikon&op=content&tid=13820">word ] [ ref="module.php?name=Lexikon&op=content&tid=13891">X ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2892 Reads)

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

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