Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: Richard Damon 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: <10fbe4d3-a1d1-4740-8d23-8cd96f3b9bfc@att.net> <696c5a55-3cb6-4fa7-bd11-9b8f8eeeaef7@att.net> <3f902f42-e435-4a44-a179-687ad2a33f16@att.net> <4f0bc5b5-aba7-4c19-91f7-d4f9788591a0@att.net> <6c74c2e9-17d7-4eb4-afcd-c058309b6c8a@tha.de> <4327ba4a-e810-4565-83e8-b9572018ac35@att.net> <4c34b3b0a23a72c385c38720128385c06ae6519c@i2pn2.org> 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: 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.