Re: Aleph One Sets
From: Mike Oliver (mike_lists_at_verizon.net)
Date: 10/20/04
- Next message: Jan Murray: "CFP: Call for Tutorial/Workshop Proposals -- KI 2005"
- Previous message: G. Frege: "Re: (Not quite) Cantor's diagonal proof"
- In reply to: Apollo Hogan: "Re: Aleph One Sets"
- Next in thread: Apollo Hogan: "Re: Aleph One Sets"
- Reply: Apollo Hogan: "Re: Aleph One Sets"
- Reply: Keith Ramsay: "Re: Aleph One Sets"
- Messages sorted by: [ date ] [ thread ]
Date: Wed, 20 Oct 2004 11:59:55 -0500
Apollo Hogan wrote:
> In article <cl39iv0r3s@drn.newsguy.com>,
> Daryl McCullough <daryl@atc-nycorp.com> wrote:
>>Here's a cardinality question for you (the answer *might* be aleph_1)
>>
>>Define an equivalence class on sets of reals as follows: R1 ~~ R2 if
>>there exists an order-preserving bijection between R1 and R2. What is
>>the cardinality of the set of equivalence classes of ~~?
>
>
> Well, if 2^aleph_0 = aleph_beta, then there will be at least beta different
> equivalence classes (one of each cardinality), so, for example, in a model
> where 2^aleph_0 = aleph_(omega_2), there are (at least) aleph_2 different
> equivalence classes.
Nice!
But one can do better--it's not hard to show directly that there are
at least 2^{aleph_0} distinct classes. Embed length-omega strings of
zeroes and ones thusly: For each 0, put a copy of omega in
an interval; for each 1, a copy of omega* (that's omega reversed).
Here's what I'm wondering: Can you actually embed 2^{2^aleph_0}?
I don't immediately see why or why not.
- Next message: Jan Murray: "CFP: Call for Tutorial/Workshop Proposals -- KI 2005"
- Previous message: G. Frege: "Re: (Not quite) Cantor's diagonal proof"
- In reply to: Apollo Hogan: "Re: Aleph One Sets"
- Next in thread: Apollo Hogan: "Re: Aleph One Sets"
- Reply: Apollo Hogan: "Re: Aleph One Sets"
- Reply: Keith Ramsay: "Re: Aleph One Sets"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|