Explanation: A Note on Well-ordered Sets
In literature, the above two different versions of well-ordered sets can be found, one for partial orders and one for strict orders. Because partial orders are reflexive, and because strict orders are irreflexive, the alternative definitions require the existence of either a minimum or a minimal element in the subset $S.$ Both definitions have their advantages and disadvantages, but only the latter has the advantage that it is compatible with the definition of well-founded relations, which are very useful in introducing the ordinal numbers, which we learn more about later.
For the time being, we will use the poset version, unless otherwise stated.
| | | | created: 2019-02-17 17:12:11 | modified: 2019-02-17 17:21:49 | by: bookofproofs | references: , , 
This work is a derivative of:
Bibliography (further reading)
 Hoffmann, D.: “Forcing, Eine Einführung in die Mathematik der Unabhängigkeitsbeweise”, Hoffmann, D., 2018
 Knauer Ulrich: “Diskrete Strukturen – kurz gefasst”, Spektrum Akademischer Verlag, 2001
 Reinhardt F., Soeder H.: “dtv-Atlas zur Mathematik”, Deutsche Taschenbuch Verlag, 1994, 10