OnlineWoerterBuecher.de - Lexikon, Free On-line Dictionary of Computing



	OnlineWoerterBuecher.de

Navigation

Start

Deutsch-Englisch

Deutsch-Spanisch

Enzyklopädie

Internes

Impressum

Kontakt

Lexikon

bounded

In domain theory, a SubSet S of a 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 complete. ("<=" iS written in LaTeX aS SubSeteq). (1995-02-03)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ ar ] [ arc ] [ aS ] [ at ] [ b ] [ bo ] [ bS ] [ ch ] [ co ] [ com ] [ complete ] [ cpo ] [ de ] [ do ] [ domain ] [ domain theory ] [ du ] [ ed ] [ element ] [ er ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ iS ] [ it ] [ LaTeX ] [ leaSt upper bound ] [ Lex ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ om ] [ pe ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ S ] [ Se ] [ Set ] [ So ] [ St ] [ Su ] [ SubSeteq ] [ T ] [ th ] [ theory ] [ tt ] [ up ] [ upper bound ] [ ve ] [ word ] [ X ]

[ Go Back ]

Free On-line Dictionary of Computing

	All logos and trademarks in this site are property of their respective owner. Page Generation in 0.0997 Seconds, with 17 Database-Queries