Re: Would it matter if ZF was inconsistent?

In article
<76012f50-20a6-48d6-a3a0-9ffd837bb1c3@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
WM <mueckenh@xxxxxxxxxxxxxxxxx> wrote:

On 20 Jul., 07:14, "Peter Webb"
<webbfam...@xxxxxxxxxxxxxxxxxxxxxxxxx>
I am still waiting for your construction of the tree.

This is done by specifying the set of nodes, and the set of links between
nodes.

A definition can be done by text or by drawing, like here (see slide
26)

http://www.hs-augsburg.de/~mueckenh/GU/GU12.PPT

Virgil produced such a tree definition, but alas it does not have the
properties you claim.

My definition has the property that the number of paths, by logical
reasons, cannot be larger than that of nodes.

WM has neither logic nor reasoning by which to justify that claim, at
least if his binary tree has only countably many nodes and each path
also has countably many nodes.

If each path contains infinitely many nodes and each non-root node can
be either a left child (0) or a right child (1), then Cantor proved the
any listing of such paths is incomplete, and WM's attempts to attack
that proof all fail.


If you think you have been successful, as a first step please determine what
N corresponds to the Real 1/3. If there is no such N, then you have failed.

In my game "conquer the binary tree", node number 1 may correspond to
1/3. Would that be alright?

Which path in WM's alleged list of paths corresponds to Cantor's
"anti-diagonal" for that very list?

--
Virgil
.

Relevant Pages

  • Re: Would it matter if ZF was inconsistent?
    ... reasons, cannot be larger than that of nodes. ... be either a left child or a right child, ... Which path in WM's alleged list of paths corresponds to Cantor's ... Try to construct an antidiagonal of the binary tree and try to find ...
    (sci.logic)
  • Re: Whos up for a friendly round of debating CANTORS PROOF?
    ... Finding reasons to favor ... In the complete infinite Binary Tree at most countably many ... The nodes are readily labeled by the naturals, ...
    (sci.math)
  • Re: What does diagonalization prove?
    ... Binary Tree forbids the construction of uncountably many infinte ... A Simple Model for a Complete Infinite Binary Tree: ... It is easily seen that every node has two and only two child nodes, ... A path, P, in this tree is any minimal subset of N such that ...
    (sci.math)
  • Re: how to walk a binary tree
    ... > I have a question about how to walk a binary tree. ... If the current node prints into slot, the left child prints into 2*slot+1, ... but I don't know how a queue can help. ... If you have to use depth first search for some reason, you can use priority ...
    (comp.lang.cpp)
  • Re: walking a binary tree
    ... > I have a question about how to walk a binary tree. ... > node is at and whether it's a left or right child. ... but I don't know how a queue can help. ... if non empty root add the root to the q ...
    (comp.lang.c)