Re: Separation,Power and Countability.



On Jun 17, 11:58 am, zuhair <zaljo...@xxxxxxxxx> wrote:
On Jun 17, 10:41 am, MoeBlee <jazzm...@xxxxxxxxxxx> wrote:

On Jun 17, 7:41 am, MoeBlee <jazzm...@xxxxxxxxxxx> wrote:

On Jun 17, 6:47 am, LauLuna <laureanol...@xxxxxxxx> wrote:

Eliminate the variable f by
giving it a constant name,

Maybe that's justified in your logic; but it's not justified in mine.

I was wrong; you're right, LauLuna. We can make that move to a
constant symbol (I'm so used to using variables that I forgot, e.g.,
Enderton's version of rule EI). zuhair's revised separation schema
does not block Cantor's argument.

MoeBlee

Yeah, actually I suspected that from the start.
However I still think that separation is the
culprit. I know we can keep separation and revise
power(see the last versions I suggested in this thread)
but still I am not satisfied with this restriction
on power. If we want to add definability axiom
then we should change separation to something else,
to an axiom that doesn't allow Cantor's proof, otherwise
well end up with an inconsistent theory.

By the way is xew&~xef(x) a stratified formula?
were f in injection from w to P(w).

I still think that modifying separation is essential for definability.

Zuhair

Separation can be modified such as to block Cantor's argument using
different ways, like not allowing negative formulae to be sued in
separation, or not allowing non stratified formulae etc....

Anyhow. I have a question.

Question: Working in Z.
if we call ~xef(x) were f:w->P(w),f is injective, if we call it the
DIAGONAL FORMULA FOR P(w).

To be more clear the diagonal formula of A were A is uncounatble,
refers to the formula in separation that proves the uncountability of
A.

My question is that we know that the diagonal formula for
P(w) is ~xef(x).

Now what is the diagonal formula for P(w)\{0}
Also what is the diagonal formula for P(w)\{w}

certainly it is not ~xef(x).
since this fails when all members in w are in their
images in the case of P(w)\{0}, since d={xew&~xef(x)}
were f:w->P(w)\{0} is injective. then d=0 which is not in
P(w).

Similarily this failes in the case of P(w)\{w} if all members of f are
not in their images, since d=w which
is not in P(w)\{w}.

anyhow I am sure that with the standard version of separation there
should be a diagonal formula for these sets, and for any unoucntable
subset of P(w).

It would be even more interesting if we knew the
the rule by which we infer the diagonal formula for
every P(w)\A were A is a countable subset of P(w).

Or even in a more general manner it would be very interesting if we
knew the rule by which we can infer the diagonal formula for every P(S)
\A were S is infinite
and A is a countable subset of P(S).

Zuhair

Zuhair

.



Relevant Pages

  • Re: Separation,Power and Countability.
    ... constant symbol (I'm so used to using variables that I forgot, e.g., ... zuhair's revised separation schema ... However I still think that separation is the ... If we want to add definability axiom ...
    (sci.math)
  • Re: Separation,Power and Countability.
    ... constant symbol (I'm so used to using variables that I forgot, e.g., ... zuhair's revised separation schema ... However I still think that separation is the ... To be more clear the diagonal formula of A were A is uncounatble, ...
    (sci.math)