Abstract
This chapter focuses on well ordering.The set of all natural numbers is a well ordered set. A linear ordering of a set A is a well ordering if every non-empty subset of the set A has a first element. As per the definition of well ordering, every subset of a well ordered set is well ordered. On the other hand, a well ordered set can contain an element, for which there does not exist an element, which is an immediate predecessor. No two initial intervals of a well ordered set are similar. For every set A, there exists a mapping E that assigns to every nonempty subset of A one of its elements. For every set A, there exists a relation that establishes its well ordering.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
