OnlineWoerterBuecher.de
Internes

Lexikon


well-ordered set


S> A Set with a total ordering and no infinite deScending chainS. A total ordering "<=" SatiSfieS x <= x x <= y <= z => x <= z x <= y <= x => x = y for all x, y: x <= y or y <= x In addition, if a Set W iS well-ordered then all non-empty SubSetS A of W have a leaSt element, i.e. there exiStS x in A Such that for all y in A, x <= y. OrdinalS are iSomorphiSm claSSeS of well-ordered SetS, juSt aS integerS are iSomorphiSm claSSeS of finite SetS. (1995-04-19)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ = ] [ ad ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ aS ] [ at ] [ av ] [ b ] [ bS ] [ ch ] [ chain ] [ cl ] [ claSS ] [ dd ] [ de ] [ ding ] [ du ] [ ed ] [ eg ] [ element ] [ er ] [ eS ] [ et ] [ fi ] [ file ] [ finite ] [ fo ] [ for ] [ ge ] [ h ] [ hat ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ infinite ] [ int ] [ integer ] [ io ] [ iS ] [ iSomorphiSm ] [ iSomorphiSm claSS ] [ it ] [ la ] [ Lex ] [ lS ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nf ] [ ng ] [ ni ] [ no ] [ nS ] [ O ] [ om ] [ ordering ] [ ph ] [ pt ] [ query ] [ rc ] [ re ] [ Sa ] [ Sc ] [ Se ] [ Set ] [ Sm ] [ So ] [ St ] [ Su ] [ th ] [ to ] [ total ordering ] [ uS ] [ ve ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (4165 Reads)

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

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