| Deutsch English Français Italiano |
|
<vilkh1$3k21l$14@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> Newsgroups: sci.math Subject: Re: Incompleteness of Cantor's enumeration of the rational numbers (extra-ordinary) Date: Mon, 2 Dec 2024 16:48:34 -0800 Organization: A noiseless patient Spider Lines: 120 Message-ID: <vilkh1$3k21l$14@dont-email.me> References: <vg7cp8$9jka$1@dont-email.me> <vi41rg$3cj8q$1@dont-email.me> <d124760c-9ff9-479f-b687-482c108adf68@att.net> <vi56or$3j04f$1@dont-email.me> <4a810760-86a1-44bb-a191-28f70e0b361b@att.net> <vi6uc3$3v0dn$4@dont-email.me> <b2d7ee1f-33ab-44b6-ac90-558ac2f768a7@att.net> <vi7tnf$4oqa$1@dont-email.me> <23311c1a-1487-4ee4-a822-cd965bd024a0@att.net> <e9eb6455-ed0e-43f6-9a53-61aa3757d22d@tha.de> <71758f338eb239b7419418f49dfd8177c59d778b@i2pn2.org> <via83s$jk72$2@dont-email.me> <viag8h$lvep$1@dont-email.me> <viaj9q$l91n$1@dont-email.me> <vibvfo$10t7o$1@dont-email.me> <vic6m9$11mrq$4@dont-email.me> <vicbp2$1316h$1@dont-email.me> <vid4ts$1777k$2@dont-email.me> <vidcv3$18pdu$1@dont-email.me> <bdbc0e3d-1db2-4d6a-9f71-368d36d96b40@tha.de> <vier32$1madr$1@dont-email.me> <vierv5$1l1ot$2@dont-email.me> <viiqfd$2qq41$5@dont-email.me> <vik73d$3a9jm$1@dont-email.me> <vikg6c$3c4tu$1@dont-email.me> <9bcc128b-dea8-4397-9963-45c93d1c14c7@att.net> <tfGdnSEN5pqwydP6nZ2dnZfqn_cAAAAA@giganews.com> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Tue, 03 Dec 2024 01:48:34 +0100 (CET) Injection-Info: dont-email.me; posting-host="f777e730b2e8168ebcdb2932c05660c1"; logging-data="3803189"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19jF3XbXXcM/jcnClileI9t4XUSja2Ynes=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:tgApzYastMGlXjWVgdvyZzRysQo= Content-Language: en-US In-Reply-To: <tfGdnSEN5pqwydP6nZ2dnZfqn_cAAAAA@giganews.com> Bytes: 5558 On 12/2/2024 4:43 PM, Ross Finlayson wrote: > On 12/02/2024 04:32 PM, Jim Burns wrote: >> On 12/2/2024 9:28 AM, WM wrote: >>> On 02.12.2024 12:53, FromTheRafters wrote: >> >>>> [...] >>> >>> Infinite endsegments contain an infinite set each, >>> infinitely many elements of which >>> are in the intersection. >> >> Yes to: >> ⎛ regarding finite.cardinals, >> ⎜ for each end.segment E(k) >> ⎜ there is a subset S such that >> ⎝ for each finite cardinal j, j < |S| ≤ |E(k)| >> >> No to: >> ⛔⎛ regarding finite.cardinals, >> ⛔⎜ ⮣ there is a subset S such that ⮧ >> ⛔⎜ ⮤ for each end.segment E(k) ⮠ >> ⛔⎝ for each finite cardinal j, j < |S| ≤ |E(k)| >> >> A quantifier shift tells you (WM) what you (WM) _expect_ >> but a quantifier shift is untrustworthy. >> >>> An empty intersection cannot come before >>> an empty endsegment has been produced by >>> losing one element at every step. >> >> No. >> Because see below. >> >>> E(1), E(2), E(3), ... >>> and >>> E(1), E(1)∩E(2), E(1)∩E(2)∩E(3), ... >>> are identical for every n and in the limit >>> because >>> E(1)∩E(2)∩...∩E(n) = E(n). >> >> They are >> identical COUNTER.EXAMPLES to what you expect. >> >> ---- >>> An empty intersection cannot come before >>> an empty endsegment has been produced by >>> losing one element at every step. >> >> No. >> For the set of finite cardinals, >> EVEN IF NO END.SEGMENT IS EMPTY, >> the intersection of all end segments is empty. >> >> ⎛ The set of finite.cardinals holds >> ⎜ only finite.cardinals. >> ⎜ >> ⎜ Each finite.cardinal is finite. >> ⎜ >> ⎜ For each finite.cardinal, >> ⎜ only finitely.many finite.cardinals are ≤ it. >> ⎜ >> ⎜ For each finite.cardinal, >> ⎜ only end.segments which start ≤ it >> ⎜ hold it. >> ⎜ >> ⎜ For each finite.cardinal, >> ⎝ only finitely.many end.segments hold it. >> >> ⎛ The set of finite cardinals holds >> ⎜ all finite.cardinals. >> ⎜ >> ⎜ Each finite.cardinal is followed by >> ⎜ another finite.cardinal. >> ⎜ >> ⎜ No finite.cardinal is last. >> ⎜ >> ⎜ The set of finite cardinals has >> ⎜ a subset (itself) which is not two.ended. >> ⎜ >> ⎜ The set of finite cardinals is infinite. >> ⎜ >> ⎜ Each finite.cardinal starts an end.segment. >> ⎜ >> ⎝ There are infinitely.many end.segments. >> >> ⎛ For each finite.cardinal, >> ⎜ only finitely.many end.segments hold it. >> ⎜ >> ⎜ There are infinitely.many end.segments. >> ⎜ >> ⎜ For each finite.cardinal, >> ⎜ not all end.segments hold it. >> ⎜ >> ⎜ For each finite.cardinal, >> ⎜ the intersection doesn't hold it >> ⎜ >> ⎜ EVEN IF NO END.SEGMENT IS EMPTY, >> ⎜⎛ For each finite.cardinal, >> ⎜⎜ only finitely.many end.segments hold it. >> ⎜⎜ For each finite.cardinal, >> ⎜⎜ only finitely.many end.segments hold it. >> ⎜⎜ For each finite.cardinal, >> ⎜⎝ the intersection doesn't hold it >> ⎜ >> ⎜ EVEN IF NO END.SEGMENT IS EMPTY, >> ⎝ the intersection of all end segments is empty. >> >> > > The usual idea of wrestling with a pig is > that you both get dirty, and the pig likes it. > > > Quit letting that pig dirty things. Humm... Indeed. I have heard this before: Never get into an argument with a pig. It will drag you down to its piggish low level and beat you with experience... ;^o