inductively ordered
A partially ordered set is inductively ordered iff every chain of elements of has an upper bound in .
Examples. The power set of any set is inductively ordered by the set inclusion (http://planetmath.org/Set); any finite set
of integers is inductively ordered by divisibility.
Cf. inductive set.