PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (237)
Orphanage
Unclass'd
Unproven (550)
Corrections (54)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Copyright
About
Owner confidence rating: Very high Entry average rating: No information on entry rating
[parent] inductively ordered (Definition)

A partially ordered set $A$ is inductively ordered iff every chain of elements of $A$ has an upper bound in $A$ .

Examples. The power set $2^M$ of any set $M$ is inductively ordered by the set inclusion; any finite set of integers is inductively ordered by divisibility.

Cf. inductive set.



"inductively ordered" is owned by rspuzio. [ owner history (1) ]
(view preamble | get metadata)

View style:

See Also: Zorn's lemma

Also defines:  inductive order, inductively orderes set

This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: inductive set, divisibility, integers, finite set, power set, upper bound, elements, chain, iff, partially ordered set
There are 3 references to this entry.

This is version 5 of inductively ordered, born on 2005-01-02, modified 2005-04-14.
Object id is 6610, canonical name is InductivelyOrdered.
Accessed 3382 times total.

Classification:
AMS MSC: 06A99 (Order, lattices, ordered algebraic structures :: Ordered sets :: Miscellaneous)
Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)