Let A be the number of totally-ordered sets below, and let B be the number of well-ordered sets below. What is A + B ?
S = R with the standard order.
S = 2 R , the power set of R , ordered by set inclusion, i.e. A ≤ B iff A ⊆ B .
S = R 2 with the dictionary order.
S = N , with the order given by 3 × 2 0 , 5 × 2 0 , 7 × 2 0 , 9 × 2 0 , ⋮ … , 3 × 2 1 , 5 × 2 1 , 7 × 2 1 , 9 × 2 1 , 1 × 2 2 , 3 × 2 2 , 5 × 2 2 , 7 × 2 2 , 9 × 2 2 , 1 × 2 1 , … , … , … , … , 1 × 2 0 .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!
Problem Loading...
Note Loading...
Set Loading...