Re: Every set can be ... ordered?
- From: "Rupert" <rupertmccallum@xxxxxxxxx>
- Date: 25 Aug 2006 16:55:44 -0700
MoeBlee wrote:
For Z or ZF, "every set can be well ordered" is equivalent to the axiom
of choice.
But what about "every set can be totally ordered"? Is it a theorem of Z
or a theorem of ZF (if so, what is the proof?) or is it independent of
Z and independent of ZF (and who proved it such?).
If ZF is consistent, then the proposition that the set of functions
from the reals to the reals can be totally ordered is indepedent of ZF.
Cohen proved this at the same time as he proved the independence of the
continuum hypothesis. See "Set Theory and the Continuum Hypothesis".
And what about "every set can be partially ordered"?
I would think this is provable, consider the transitive closure of the
membership relation.
MoeBlee
.
- Follow-Ups:
- Re: Every set can be ... ordered?
- From: MoeBlee
- Re: Every set can be ... ordered?
- References:
- Every set can be ... ordered?
- From: MoeBlee
- Every set can be ... ordered?
- Prev by Date: bXc = b -> b=0 (with regularity but not infinity)
- Next by Date: Re: Every set x equinumerous with a set y disjoint from x?
- Previous by thread: Re: Every set can be ... ordered?
- Next by thread: Re: Every set can be ... ordered?
- Index(es):
Relevant Pages
|
|