OnlineWoerterBuecher.de
Internes

Lexikon


algebraic


In domain theory, a complete partial order is algebraic if every element is the least upper bound of some chain of compact elements. If the set of compact elements is countable it is called omega-algebraic. [Significance?] (1995-04-25)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ al ] [ algebra ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ b ] [ bo ] [ br ] [ ca ] [ ch ] [ chain ] [ co ] [ com ] [ compact ] [ complete ] [ countable ] [ de ] [ do ] [ domain ] [ domain theory ] [ du ] [ ed ] [ eg ] [ element ] [ er ] [ et ] [ fi ] [ file ] [ ga ] [ ge ] [ gn ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ is ] [ it ] [ least upper bound ] [ Lex ] [ ma ] [ meg ] [ mega- ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ni ] [ om ] [ pa ] [ pe ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ S ] [ se ] [ set ] [ Sig ] [ so ] [ st ] [ table ] [ th ] [ theory ] [ up ] [ upper bound ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4630 Reads)

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

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