Re: Request for Review of ZF Inconsistency Proof

Scott <ToaTerra@xxxxxxxxx> writes:

Continuing:

Proposition 2.2: There exists an injective function f' from S to N.

Proof: Let f' be

f'(s) = Sum(x=0..infinity) of (2^x * s[x]).

By construction, every string s will generate some natural number n.
Suppose f'(s)=n and f'(s)=m where n != m. Then there exists some y
such that (2^y*s[y]) != (2^y*s[y]). Contradiction. Therefore, f' is an
injective function from S to N.

Comments/feedback?


Let s be the string 11111... . What is f'(s)?

--
God made the bees
And the bees make honey.
The miller's man does all the work,
But the miller makes the money. --- Mother Goose
.

Relevant Pages

  • Re: Request for Review of ZF Inconsistency Proof
    ... There exists an injective function f' from S to N. ... By construction, every string s will generate some natural number n. ... Comments/feedback? ...
    (sci.logic)
  • Re: Request for Review of ZF Inconsistency Proof
    ... There exists an injective function f' from S to N. ... every string s will generate some natural number n. ... non-zero terms, then there is no such injection as described, as there ... most infinite binary sequences have been omitted. ...
    (sci.logic)
  • Re: Question regarding the diagonal method.
    ... the diagonal construction. ... This will give a string starting with 0 ... and differing from the the nth ... you can define it as 1-s), where f is ANY injective function. ...
    (sci.logic)
Quantcast