OnlineWoerterBuecher.de
Internes

Lexikon


complete partial ordering


(cpo) A partial ordering of a set under a relation, where all directed suBsets have a {least upper Bound}. A cpo is usually defined to include a least element, Bottom (David Schmidt calls this a pointed cpo). A cpo which is algeBraic and Boundedly complete is a (Scott) domain. (1994-11-30)

In addition suitaBle contents:<Br>[ = ] [ ai ] [ al ] [ algeBra ] [ algeBraic ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ av ] [ B ] [ Bo ] [ Bot ] [ Bottom ] [ Bounded ] [ Boundedly complete ] [ Br ] [ Bs ] [ ca ] [ ch ] [ chm ] [ cl ] [ co ] [ com ] [ complete ] [ cpo ] [ D ] [ de ] [ do ] [ domain ] [ du ] [ ec ] [ ed ] [ element ] [ er ] [ et ] [ fi ] [ file ] [ ge ] [ h ] [ hm ] [ hr ] [ id ] [ il ] [ in ] [ inc ] [ include ] [ int ] [ io ] [ ir ] [ is ] [ la ] [ least upper Bound ] [ Lex ] [ ls ] [ lu ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ng ] [ om ] [ ordering ] [ pa ] [ partial ordering ] [ pe ] [ ph ] [ pl ] [ point ] [ query ] [ rc ] [ re ] [ relation ] [ S ] [ se ] [ set ] [ st ] [ su ] [ th ] [ theory ] [ to ] [ tt ] [ ua ] [ up ] [ upper Bound ] [ us ] [ ve ] [ vi ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4142 Reads)

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

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