| Deutsch English Français Italiano |
|
<669b484b5bc21115d0c4e7144b54fe34a3695c26@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: sci.math
Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers
(extra-ordinary)
Date: Mon, 16 Dec 2024 07:30:30 -0500
Organization: i2pn2 (i2pn.org)
Message-ID: <669b484b5bc21115d0c4e7144b54fe34a3695c26@i2pn2.org>
References: <vg7cp8$9jka$1@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>
<b1d876ee-d815-4540-bc6f-fe7c27c146a3@att.net> <vjmgdm$i9be$1@dont-email.me>
<abf7344d-b95b-4432-8626-8356dc1dd261@att.net> <vjn9ud$mlgt$2@dont-email.me>
<4c34b3b0a23a72c385c38720128385c06ae6519c@i2pn2.org>
<vjoo97$11npa$3@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 16 Dec 2024 12:30:30 -0000 (UTC)
Injection-Info: i2pn2.org;
logging-data="3134483"; mail-complaints-to="usenet@i2pn2.org";
posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
In-Reply-To: <vjoo97$11npa$3@dont-email.me>
X-Spam-Checker-Version: SpamAssassin 4.0.0
Bytes: 2642
Lines: 18
On 12/16/24 3:27 AM, WM wrote:
> On 15.12.2024 21:20, joes wrote:
>
>> Duh. All naturals are finite. You need to actually remove all inf.many
>> of them.
>
> That is not possible with definable naturals:
> ∀n ∈ ℕ_def: |ℕ \ {1, 2, 3, ..., n}| = ℵo.
> And numbers which succeed
> ∀k ∈ ℕ: ∩{E(1),E(2),...,E(k+1)} = ∩{E(1),E(2),...,E(k)}\{k}
> produce finite endsegments and therefore are invisible.
>
> Regards, WM
Of course it is possible with the definable naturals, you just need to
do the INFINITE number of steps, which your logic can't do.
Your finite logic just blows itself up into smithereens, leaving behind
the darkness of its inconsistencies.