OnlineWoerterBuecher.de
Internes

Lexikon


Scott-closed


A set S, a subset of D, is Scott-closed if (1) If Y is a subset of S and Y is directed then lub Y is in S and (2) If y <= s in S then y is in S. I.e. a Scott-closed set contains the lubs of its directed subsets and anything less than any element. (2) says that S is downward closed (or left closed). ("<=" is written in LaTeX as sqsubseteq). (1995-02-03)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ bs ] [ ch ] [ cl ] [ closed set ] [ co ] [ con ] [ D ] [ do ] [ down ] [ du ] [ ec ] [ ed ] [ element ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ h ] [ hat ] [ hing ] [ hr ] [ id ] [ il ] [ in ] [ ir ] [ is ] [ it ] [ LaTeX ] [ less than ] [ Lex ] [ lose ] [ lu ] [ lub ] [ mo ] [ mod ] [ module ] [ na ] [ ng ] [ ns ] [ ph ] [ query ] [ rc ] [ re ] [ S ] [ sa ] [ say ] [ se ] [ set ] [ sqsubseteq ] [ su ] [ subseteq ] [ T ] [ th ] [ tt ] [ X ] [ Y ] [ yt ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2590 Reads)

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

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