Re: Well ordering
- From: "Saurav" <saurav1b@xxxxxxxxx>
- Date: 14 Jan 2007 19:45:30 -0800
José Carlos Santos wrote:
Saurav wrote:Yes, but can you supply a proof that in ZF, this statement requires AC?
Let alpha be a well orderable infinite set; can we well order 2^alpha
without AC?
As I told you a few days ago, N is well orderable, but without the axiom
of choice you can't prove that 2^N is well-orderable.
Actually, I don't know whether there has been such a proof.
If not, give an example of such an alpha, well orderable,
that within ZF, 2^alpha can not be well ordered.
I can't do that. In ZF you cannot prove that 2^N is well orderable. This
is *not* the same thing as saying that in ZF you can prove that 2^n is
not well orderable.
Best regards,
Jose Carlos Santos
.
- Follow-Ups:
- Re: Well ordering
- From: José Carlos Santos
- Re: Well ordering
- From: Aatu Koskensilta
- Re: Well ordering
- From: Proginoskes
- Re: Well ordering
- References:
- Well ordering
- From: Saurav
- Re: Well ordering
- From: José Carlos Santos
- Well ordering
- Prev by Date: Re: well ordering
- Next by Date: Re: Vector Problem
- Previous by thread: Re: Well ordering
- Next by thread: Re: Well ordering
- Index(es):
Relevant Pages
|