OnlineWoerterBuecher.de
Internes

Lexikon


bounded


eory> In ef="module.php?name=Lexikon&file=search&eid=1&query=domain theory">domain theory, a subset S of a ef="module.php?name=Lexikon&file=search&eid=1&query=cpo">cpo X is bounded if there exists x in X such that for all s in S, s <= x. In other words, there is some element above all of S. If every bounded subset of X has a least upper bound then X is boundedly ef="module.php?name=Lexikon&file=search&eid=1&query=complete">complete. ("<=" is written in ef="module.php?name=Lexikon&file=search&eid=1&query=LaTeX">LaTeX as ef="module.php?name=Lexikon&file=search&eid=1&query=subseteq">subseteq). (1995-02-03)

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=411">ai ] [ 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=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=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=2777">cpo ] [ ef="module.php?name=Lexikon&op=content&tid=3151">de ] [ ef="module.php?name=Lexikon&op=content&tid=3565">do ] [ ef="module.php?name=Lexikon&op=content&tid=3595">domain ] [ ef="module.php?name=Lexikon&op=content&tid=3611">domain theory ] [ ef="module.php?name=Lexikon&op=content&tid=3752">du ] [ ef="module.php?name=Lexikon&op=content&tid=3896">ed ] [ ef="module.php?name=Lexikon&op=content&tid=4008">element ] [ ef="module.php?name=Lexikon&op=content&tid=4148">er ] [ 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=4700">fo ] [ ef="module.php?name=Lexikon&op=content&tid=4727">for ] [ ef="module.php?name=Lexikon&op=content&tid=5434">h ] [ ef="module.php?name=Lexikon&op=content&tid=5540">hat ] [ 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=6482">is ] [ ef="module.php?name=Lexikon&op=content&tid=6558">it ] [ ef="module.php?name=Lexikon&op=content&tid=6989">LaTeX ] [ 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=7441">ly ] [ ef="module.php?name=Lexikon&op=content&tid=7463">ma ] [ 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=8964">om ] [ 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=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=12148">subseteq ] [ ef="module.php?name=Lexikon&op=content&tid=12359">T ] [ ef="module.php?name=Lexikon&op=content&tid=12588">th ] [ ef="module.php?name=Lexikon&op=content&tid=12602">theory ] [ 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 ] [ ef="module.php?name=Lexikon&op=content&tid=13820">word ] [ ef="module.php?name=Lexikon&op=content&tid=13891">X ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3513 Reads)

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

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