Deutsch English Français Italiano |
<89598d353b5737d5cbfabd1cde31c797a212e13d@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.misty.com!weretis.net!feeder9.news.weretis.net!news.nk.ca!rocksolid2!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, effectively) Date: Thu, 2 Jan 2025 14:47:45 -0500 Organization: i2pn2 (i2pn.org) Message-ID: <89598d353b5737d5cbfabd1cde31c797a212e13d@i2pn2.org> References: <vg7cp8$9jka$1@dont-email.me> <vk7dmb$7mh2$2@dont-email.me> <b72490c1-e61a-4c23-a3a5-f624b2c084e4@att.net> <vk8tbq$j9h1$1@dont-email.me> <bd7dfdc7-6471-4fe6-b078-0ca739031580@att.net> <vklumc$3htmt$1@dont-email.me> <c03cf79d-0572-4b19-ad92-a0d12df53db9@att.net> <n9CdnR02SsevtPL6nZ2dnZfqnPidnZ2d@giganews.com> <45a632ed-26cc-4730-a8dd-1e504d6df549@att.net> <vkpa98$dofu$2@dont-email.me> <3d2fe306aa299bc78e94c14dadd21645d8db9829@i2pn2.org> <vkr8sq$t59a$2@dont-email.me> <d4669f26483b01c8a43dfd3ac4b61ab4a42bf551@i2pn2.org> <vksikk$17fjt$1@dont-email.me> <aa2941e93e806f1dda55d563dd062db67eb879f1@i2pn2.org> <vktmi3$1ia1u$1@dont-email.me> <c46775b30460bc564b3fe7bd1b838713829024f8@i2pn2.org> <vkv3t1$1qb93$1@dont-email.me> <2163aa0c0efba66c813e8ebda5ef5ece6d19ea34@i2pn2.org> <vl1bp4$2bcos$2@dont-email.me> <ac6061d7f9963a83c7a67f474fe9cb835c98cf5b@i2pn2.org> <vl5tvs$39tus$1@dont-email.me> <9387e323873e24f0a57b8daa49579d9a1c517563@i2pn2.org> <vl6i2u$3ecap$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Thu, 2 Jan 2025 19:47:45 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="1700256"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird X-Spam-Checker-Version: SpamAssassin 4.0.0 In-Reply-To: <vl6i2u$3ecap$2@dont-email.me> Content-Language: en-US Bytes: 2997 Lines: 31 On 1/2/25 12:23 PM, WM wrote: > On 02.01.2025 14:25, Richard Damon wrote: >> On 1/2/25 6:40 AM, WM wrote: > >>> Every union of FISONs including them all which stay below a certain >>> threshold stays below that threshold. Every FISON stays below 1 % of ℕ. >>> What can't you understand? > >> No, becuase "all which stay below a certain threshol" is not EVERY FISON. > > Which one is more than 1 % of ℵ₀? There isn't one, but anytime you CHOSE what you limit is, I can go past it. If you don't choose a limit, you can't do your operation, as you can't ever finish, as you need to do the operations one by one, and thus never finish. > >> When you actually take the union of ALL that infinite set of FISONs, >> you will get the full infinite set of N. > > Stupid belief. Which FISON is more than 1 % of ℵ₀? > > Regards, WM Which isn't a valid question, as that is just admitting that FISONs form an infinte set that you logic can't manipulate. Sorry, your brain is dead.