[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Fwd: Russell's Anti-Paradox -- for translating to Lojban



oops sent it to a different list before


---------- Forwarded message ----------
From: Andrii (lOkadin) Zvorygin <andrii.z@gmail.com>
Date: Mar 19, 2007 2:16 AM
Subject: Russell's Anti-Paradox -- for translating to Lojban
To: lojban@lojban.org

The Russell's paradox has been around a long time. I really wonder why no one has noticed  that "barber shop" example is a false analogy to the Universal Set. I won't get into the barbershop example as it would only distract from the logic but I do have a full thread

da can not be an element of da. If da contained da it would be da.

It is actually inconcievable that da is an Element of da. It is concievable that da is da.

where ny = all natural numbers.

  1. say we have a set da du(=) { ny }
  2. now we have a set de du(=) { ny , { ny } }
  3. da is an element of de. Note da is not equal to de here. We can tell as they have a different number of elements as well as transfinite cardinality. Note the { } are necessary to add the piece of information distinguishing this as a set rather than an arbitrary list of unrelated numbers.
  4. da is da, but da is not an Element of da.


I just can't concieve of da being an element of da. Maybe there is a flaw to my reasoning. Please reveal to me my flaws so I can become greater..ui.ai.a'u(happy intent interest)

note .o = IFF = <-->

Let Φ(x) be any formula of first order logic in which x is a free variable.

Definition. The collection a, denoted {x : xa .o Φ(x)}, is the individual a satisfying ∀x [xa .o Φ(x)].



to which Russel says:
∀x [x∈da .o x∉x]
da∈da .o da∉da

So instead of having da∈da -- as it is inconcievable. We would have just da = da.



da = da .o da∉da
da .o da∉da

da∉da is actually a fundamental truth.
As we have just shown da can not concievable be an element of da.
So da∉da can be subsititutied with JETnu which means True.

da .o JETnu

da                                  AKA a contradiction

So as we already know that a contradiction can prove any concievable thing.

simple proof:  roda can not be proved from a contradiction. roda can be proved from a contradiction.

Can't argue with that and it's not a circular argument.  Multiplication begins! as now we have more than a single item. so wheras with a circle you have da and da, wheras with a contradiction you have da .i nada, which is something that is not da, so something else! Do you understand? Now we can increase the amount of things by adding as many nada's as we desire and renaming them de .a di .a LERfubu .a roda :D there you have it complete mathematical theory.


1/0

--
It should be noted that this  email was generated by Your subconciousness. You should note that the email you get is the email you expect -- unless you expect an unexpected email.

Have a nice day! Be Happy! :D join la.ma'aSELTcan. for more information.


--
It should be noted that this  email was generated by Your subconciousness. You should note that the email you get is the email you expect -- unless you expect an unexpected email.

Have a nice day! Be Happy! :D join la.ma'aSELTcan. for more information.


--
It should be noted that this  email was generated by Your subconciousness. You should note that the email you get is the email you expect -- unless you expect an unexpected email.

Have a nice day! Be Happy! :D join la.ma'aSELTcan. for more information.