Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Order Type
Posted:
Jun 10, 2014 8:29 AM


Is this a correct construction of the order type of a well ordered set?
Let S be well ordered, seg_a S = { x in S  a < x }.
Recursively define a function f over S with ordinal values by f(a) = f(seg_a S) = { f(x)  x < a }.
f is an order isomorphism from S onto the ordianl f(S).



