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: Matheology § 190
Replies: 15   Last Post: Jan 14, 2013 3:35 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: 15,024
Registered: 1/29/05
Re: Matheology § 190
Posted: Jan 12, 2013 4:05 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On 12 Jan., 22:00, Virgil <vir...@ligriv.com> wrote:
> In article
> <c0615860-6190-4c10-9185-78ed2f6a2...@x10g2000yqx.googlegroups.com>,
>
>  WM <mueck...@rz.fh-augsburg.de> wrote:

> > Matheology 190
>
> > The Binary Tree can be constructed by aleph_0 finite paths.
>
> >         0
> >       1, 2
> >   3, 4, 5, 6
> > 7, ...

>
> Finite trees can be built having finitely many finite paths.
> A Complete Infinite Binary Tree cannot be built with only finite paths,
> as none of its paths can be finite.
>

Then the complete infinite set |N cannot be built with only finite
initial segments {1, 2, 3, ..., n} and not with ony finite numbers 1,
2, 3, ...? Like Zuhair you are claiming infinite naturals!

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.