Re: Request for Review of ZF Inconsistency Proof
- From: Scott <ToaTerra@xxxxxxxxx>
- Date: Tue, 05 Jun 2007 17:12:36 -0000
On Jun 5, 10:00 am, magi...@xxxxxxxxxxxxxxxxx (Arturo Magidin) wrote:
Let f be f(n) = s[0],...,s[i-1],s[i]
You'll notice the absence of an ellipsis at the end. Thus, you are
saying f(n) is a FINITE string.
So incorporating feedback:
Let S denote the infinite set of infinite denumerable binary strings
with alphabet {0,1}. An individual string s is denoted as
s[0],...,s[i-1],s[i],....
Proposition 2.1: There exists an injective function f from N to S.
Proof: Let f be f(n)=s[0],...,s[i-1],s[i],... where (as previously)...
Is this sufficiently cleaned up to convey the intent?
.
- Follow-Ups:
- Re: Request for Review of ZF Inconsistency Proof
- From: Arturo Magidin
- Re: Request for Review of ZF Inconsistency Proof
- References:
- Request for Review of ZF Inconsistency Proof
- From: Scott
- Re: Request for Review of ZF Inconsistency Proof
- From: Scott
- Re: Request for Review of ZF Inconsistency Proof
- From: Arturo Magidin
- Re: Request for Review of ZF Inconsistency Proof
- From: Scott
- Re: Request for Review of ZF Inconsistency Proof
- From: Arturo Magidin
- Request for Review of ZF Inconsistency Proof
- Prev by Date: Re: Request for Review of ZF Inconsistency Proof
- Next by Date: Re: Request for Review of ZF Inconsistency Proof
- Previous by thread: Re: Request for Review of ZF Inconsistency Proof
- Next by thread: Re: Request for Review of ZF Inconsistency Proof
- Index(es):
Relevant Pages
|