(a) Let ℤ− denote the set of negative integers in the usual order. Show that a simply ordered set A fails to be well-ordered if and only if it contains a subset having the same order type as ℤ−.
(b) Show that if A is simply ordered and every countable subset of A is well-ordered, then A is well-ordered.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.