Recent content by RWood

I think I have the outline of a proof (there may of course be something much quicker!). 1) It is quite easy to get a 1-1 correspondence between C and R; a map C=>R is obvious; a 1-1 map R=>C can be constructed by transfinite induction, using the unboundedness of C to ensure successor...

Let R be the class of all ordinals. If a subset C of R is unbounded (i.e. for any ordinal \alpha \in R, there is \beta in C with \beta greater than \alpha ), then it seems to me that C cannot be a set, only a class. Is this true, and if so, how does one prove it? My reading on the general...

Thank you for the update, will see what develops.

I suspect this is not really an "advanced" probability question, but I'm not sure - haven't been near this stuff for decades. The definition: I have a jar with 2*N tea bags in it (N>0 obviously). The beginning condition is that the teabags are joined in pairs - so there are N pairs. At each...