Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: Matheology § 244
Replies: 3   Last Post: Apr 10, 2013 7:11 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
mueckenh@rz.fh-augsburg.de

Posts: 16,032
Registered: 1/29/05
Matheology § 244
Posted: Apr 10, 2013 4:23 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


Consider the diagonal d = d_1, d_2, d_3 ... of a Cantor list,
constructed by some appropriate substitution of digits d_n =/= a_nn.
For instance, if a_nn > 5 let d_n = 2, and if a_nn < 6 let d_n = 8.

If we have: For all n: d_n is an even digit. Can it be then, that d
contains any odd digit?

If we have: For all n: d_1, d_2, ..., d_n all digits are even. Can it
be then, that d contains any odd digit?

If we can prove: For all n: d_n has property P. Can it be then that
there is a digit with the property ~P?

If we can prove: For all n: d_1, d_2, ..., d_n have the property P.
Can it be then that there is a digit with the property ~P?

Cantor speaks of the Inbegriff (set) of all positive numbers n, which
should be denoted by the symbol (n). Does that differ from what we
denote by |N or "all n in |N"?

Zermelo requires a set that with a also contains {a}. What is the
difference to an inductive set that can be put in bijection with |N?

Zermelo defines identity: If M c N and N c M, then M = N.

Is the diagonal d an ordered set of all digits d_n such that the
inbegriff (d_n) differs from the set {d_n | n in |N}?

Regards, WM



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.