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.independent

Topic: The Distinguishability argument of the Reals.
Replies: 11   Last Post: Jan 5, 2013 10:30 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: 13,446
Registered: 1/29/05
Re: The Distinguishability argument of the Reals.
Posted: Jan 5, 2013 8:06 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On 4 Jan., 22:36, "Jesse F. Hughes" <je...@phiwumbda.org> wrote:

> Clearly, the set of reals is pairwise distinguishable but not totally
> distinguishable.  But so what?


A good question. A set distinguishable by such an n would necessarily
be finite. Do you think that anybody, and in particular Zuhair, claims
that |R is finite? Or did you miss this implication?

A set S of infinite strings of digits (the God of matheology may
present the strings without defining them in another way) is finitely
distinguishable if for all x, y in S, if x != y then there is an m in |
N (i.e., a finite index) such that x_m != y_m.

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.