Deutsch   English   Français   Italiano  
<vjktco$5odt$1@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!news.misty.com!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: WM <wolfgang.mueckenheim@tha.de>
Newsgroups: sci.math
Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers
 (extra-ordinary)
Date: Sat, 14 Dec 2024 22:30:00 +0100
Organization: A noiseless patient Spider
Lines: 44
Message-ID: <vjktco$5odt$1@dont-email.me>
References: <vg7cp8$9jka$1@dont-email.me> <vj3tl0$3nktg$2@dont-email.me>
 <1f1a4089-dfeb-45f8-9c48-a36f6a4688fb@att.net> <vj6bqo$b6bt$1@dont-email.me>
 <f1bcc151-ecf7-47d9-98a6-07048d422ee1@att.net> <vj7hdm$hvcf$5@dont-email.me>
 <e7b09ffb-cca3-4c85-9800-1ba36ab573df@att.net> <vj7o79$j93d$1@dont-email.me>
 <fe5bf28a-a597-4132-bc3f-94d4927b3304@att.net> <vjc8nc$1j576$1@dont-email.me>
 <e62c5824-fe06-43bf-9c17-2ea0c70a624b@att.net> <vjcqrb$1molo$1@dont-email.me>
 <10fbe4d3-a1d1-4740-8d23-8cd96f3b9bfc@att.net> <vjd1km$1nq97$1@dont-email.me>
 <696c5a55-3cb6-4fa7-bd11-9b8f8eeeaef7@att.net> <vje94n$2206n$2@dont-email.me>
 <3f902f42-e435-4a44-a179-687ad2a33f16@att.net> <vjfn3e$2upa9$4@dont-email.me>
 <4f0bc5b5-aba7-4c19-91f7-d4f9788591a0@att.net> <vjh5jh$3ccnk$1@dont-email.me>
 <c7ff89ab-f6a9-45cf-8a1f-e3a2c96f7905@att.net>
 <6c74c2e9-17d7-4eb4-afcd-c058309b6c8a@tha.de>
 <4327ba4a-e810-4565-83e8-b9572018ac35@att.net> <vjjmg2$3ukcl$1@dont-email.me>
 <784164c0-b36a-4650-a323-dccd461b330c@att.net>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Sat, 14 Dec 2024 22:30:01 +0100 (CET)
Injection-Info: dont-email.me; posting-host="046d7fae51030e0b0ef5ced8c293542c";
	logging-data="188861"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18bxMwvYAMhukXqjhL3+e6oRTC3B+NonEM="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:nxvfmiGEIuPBAK6nx6LQDxUuVxs=
In-Reply-To: <784164c0-b36a-4650-a323-dccd461b330c@att.net>
Content-Language: en-US
Bytes: 3318

On 14.12.2024 19:57, Jim Burns wrote:
> On 12/14/2024 5:26 AM, WM wrote:

>> Don't say what not is.
> 
> For sets A and B with one.to.one A.to.B
> B is not.smaller.than A

Don't say what not is.

>> Don't say what not is.
> 
> If ω-1 exists
> then
> ⎛ ω-1 is last.before.ω
> ⎜ ω is first bound of the finites
> ⎜ ω-1 is not any before.ω bound of the finites
> ⎜ ω-1 is not infinite (see [2])
> ⎜ ω-1 is finite
> ⎜ ω-1 is smaller.than (ω-1)+1, also finite (see [3])
> ⎜ (ω-1)+1 is smaller.than (ω-1)+2, also finite
> ⎜ ω bounds w-1, (ω-1)+1, (ω-1)+2
> ⎜ ω-1 < (ω-1)+1 < (ω-1)+2 ≤ ω
> ⎝ ω-1 is not last.before.ω

Don't say what not is. Explain your vision of the problem:
If ℕ is a set, i.e. if it is complete such that all numbers can be used 
for indexing sequences or in other mappings, then it can also be 
exhausted such that no element remains. Then the set of what remains 
unused, i.e., of intersections of endsegments

(1)   E(1), E(1)∩E(2), E(1)∩E(2)∩E(3), ...

loses all content. Then, by the law

(2)   ∀k ∈ ℕ : ∩{E(1), E(2), ..., E(k+1)} = ∩{E(1), E(2), ..., E(k)} \ {k}

the content must become finite.

Regards, WM