Warning: mysqli::__construct(): (HY000/1203): User howardkn already has more than 'max_user_connections' active connections in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\includes\artfuncs.php on line 21
Failed to connect to MySQL: (1203) User howardkn already has more than 'max_user_connections' active connections
Warning: mysqli::query(): Couldn't fetch mysqli in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\index.php on line 66
Article <vhqt4q$1b873$1@dont-email.me>
Deutsch   English   Français   Italiano  
<vhqt4q$1b873$1@dont-email.me>

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

Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder2.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: WM <wolfgang.mueckenheim@tha.de>
Newsgroups: sci.logic
Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers
 (extra-ordinary)
Date: Fri, 22 Nov 2024 22:30:02 +0100
Organization: A noiseless patient Spider
Lines: 71
Message-ID: <vhqt4q$1b873$1@dont-email.me>
References: <vg7cp8$9jka$1@dont-email.me> <vgsp1c$v1ss$1@dont-email.me>
 <vgsq2v$v5t1$1@dont-email.me> <vgvm6h$1k8co$1@dont-email.me>
 <vgvmvr$1kc5f$1@dont-email.me> <vh1vlb$25kic$1@dont-email.me>
 <vh2j89$29gco$1@dont-email.me> <vh4f7p$2o5hn$1@dont-email.me>
 <vh4job$2ov2c$1@dont-email.me> <vh78jp$3cbq7$1@dont-email.me>
 <vh7d5c$3cpaf$1@dont-email.me> <5b8de1bc-9f6c-4dde-a7cd-9e22e8ce19d9@att.net>
 <vhata3$59e5$2@dont-email.me> <31419fde-62b3-46f3-89f6-a48f1fe82bc0@att.net>
 <vhc77g$hdd4$1@dont-email.me> <476ae6cb-1116-44b1-843e-4be90d594372@att.net>
 <vhhr6f$1q0r9$1@dont-email.me> <ffa63cb5-8898-4aa7-80eb-8b2c51c9986d@att.net>
 <vhkhun$28qt$1@dont-email.me> <vhmtph$j1ek$1@dont-email.me>
 <vhn1jk$jf6v$1@dont-email.me> <27b8de9e-a17e-4116-ab5e-1e552bea0fce@att.net>
 <vhnmsi$n2pc$1@dont-email.me> <6d0d8060-fb60-4da6-bcdb-adc13a6179b0@att.net>
 <vho171$otvf$1@dont-email.me> <93c53518-55f8-4dca-aa3c-3e79ef268963@att.net>
 <vhoad2$qkpu$1@dont-email.me> <af54371f-192d-4fb5-a3f7-76c3d329bffd@att.net>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 22 Nov 2024 22:30:02 +0100 (CET)
Injection-Info: dont-email.me; posting-host="e66bb22bbe05828732e73e7a13999941";
	logging-data="1417443"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18RHVraZvkcgoOJI24sFxdWVldjseBShNg="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:EtyiAL3aiPqE83/vmp2idmi3wx4=
In-Reply-To: <af54371f-192d-4fb5-a3f7-76c3d329bffd@att.net>
Content-Language: en-US
Bytes: 4421

On 22.11.2024 19:51, Jim Burns wrote:
> On 11/21/2024 4:57 PM, WM wrote:

>>> The _description_ is completed.
>>> It's right there.
>>
>> The description of the set
>> not of all its elements.
> 
> The description is sufficient in order to
> finitely.investigate infinitely.many.
For instance, not all indices of the endsegments can be counted to.
Remember: The intersection of all endsegments is empty, but the 
intersection of endsegments which can be counted to is infinite.
Note that every endsegment loses only one number. Therefore there must 
exist infinitely many finite endsegments.

> ----
> We have spent a lot of pixels discussing FISONs,
> finite initial segments of naturals.
> 
> However,
> here I consider FISOCs,
> finite initial segments of claims.
> 
> FISOCs share a useful property with FISONs,
>   they are well.ordered.
> If any claim has a property,
>   then some claim has that property first.
> If any claim is written in Comic Sans,
>   then some claim is in Comic Sans first.
> If any claim is false,
>   then some claim is false first.
> 
> Consider a specific FISOC with
> a description of what.we.are.considering, broadly.
> ⎛⎛ ℕ⁺ holds numbers countable.to from.1
> ⎜⎜ ℚ⁺ holds ratios of numbers in ℕ⁺
> ⎜⎝ ℝ⁺ holds points between splits of ℚ⁺
> ⎜ Further claims about elements of ℕ⁺ ℚ⁺ ℝ⁺
> ⎝ which are each true.or.not.first.false
> 
> Broadly speaking,
> claims can be true and can be false.
> 
> Broadly speaking,
> the initial ℕ⁺.ℚ⁺.ℝ⁺ claims can be false
> about some three sets or other.
> 
> In those broader after.false instances,
> the following not.first.false claims
> are not.first.false
> whether they are true or they are false.
> 
> In the broader after.false instances,
> the following not.first.false claims
> are NOT an answer.
> 
> However,
> more narrowly,
> for what.we.are.considering,
> the initial ℕ⁺.ℚ⁺.ℝ⁺ claims are true.

They are true for a potential infinity. Consider the claim: Every 
endsegment is infinite. This claim is true for the potentially infinite 
sequence of infinite endsegments. It is not true for finite endsegments. 
But without finite endsegments there is no empty intersection of 
endsegments possible.

Regards, WM